Material for Questions 3 and 4. The reverse of a directed graph G, denoted by GRev, has vertex set fa, b, c, d, e, f,g, h, i, j, k,l,m} and adjacency lists representation as given below. L[a]: b c L[b] : ade L[c] : h i L[d] e g L[e]: f g L[f] : d L[i]: k m L[j] : dh L[k] : c g L[1] j L[m]: k For example, the L[a list encodes the fact that vertex a is the tail of two directed edges (a, b) and (a, c). In answering the questions below, the order of the contents of each of the above lists is important (a different order for a list's contents will result in a different answer, so please use the above orders for list contents - in fact we're giving you the adjacency lists of GRev rather than of G to make sure everyone gets the same answer in Question 4 and thereby make automated grading possible)