PLEASE DO ALL QUESTIONS

Consider the following undirected graph representation of a communication network: G-, with: V A, B, C, D, J, K, P, Q, R, X, Y, Zl; ES {(A, B), (A, K), (A, P), (B, C), (B, Q), (C, D), (C, R), (D, J), (D, X), (J, K), (J, Y), (K Zj (P, R),LP,Y), Q, x), 1Q,Z). R, YI. X, Z) 1. Do the following problems a. Draw the graph G, (i.e., provide a visual representation) b. Is G a simple graph? Explain. c. Provide the adjacency matrix representation of G d. Provide the adjacency list representation of G e. Provide a linked list representation of the adjacency list of G f. Provide a path or tour of length of at least 5 hops from node A to node C g. Give a depth first search spanning tree of G h. Give a breath first search spanning tree of G i. What graph H is represented by the transpose of the adjacency matrix representation of G