Data structure and algorithms

Consider the following undirected graph representation of a communication network: G , with: V (A, B, C, D, J, K, P,Q, R, X, Y, Z E = {(A, B), (A, K), (A, P), (B, C), (B, Q), (C, D), (C, R), (D,?), (D, X), (J, K), (J, Y), (K, Z), (P, R), (P, Y), 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. g. h. i. Provide a path or tour of length of at least 5 hops from nqde A to node C Give a depth first search spanning tree of G Give a breath first search spanning tree of G What graph H is represented by the transpose of the adjacency matrix representation of G