Given a graph G represented by the following list of successors. For each pair (x, y), x is the weight of the edge, y is the terminal extremity of the edge. A: (5, B) B: (3, F) C: (1, A) → (3, D) → (2, F) D: (9, C) E: (4, B) F: (2, E) → (9, D) → (3, G) G: (4, F) i. Draw the graph (10pts) ii. Show an adjacency matrix of the graph (10pts)