CSE: Data Structure

Time: 7 minutes

Please solve. I really need it. (urgently). Thanks in advance.

3. 2+3 You are given the following set of vertices V and set of edges E of an unweighted directed graph G V(G) = {A, B, C, D, E, F} E(G) = {(A,B), (B, C), (C, B), (C, D), (D, A), (D, E), (E, A), (E, B)} = i. ii. Draw the graph Write down the adjacency matrix and adjacency list representation of the graph