DO THE PROBLEMS: 2E , 2F , 2G , 3A please !

Consider the following undirected graph representation of a communication network: G , with: V A, B, C, D, J, K, P, a, R, x, Y, Zi 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 8 Give a depth first search spanning tree of CG h. Give a breath first search spanning tree of G t What graph H is represented by the transpose of the adjacency matrix representation of G? The graph G, given above, is converted into a weighted graph wG-w, wE>, as follows: WE= (((A, B), 5), ((A, K), 4), ((A, p), 3), ((B.q 6. ((B, O), 3), ((c, D. 2), ((C, R), 31, (D,?4) ((D, X), 2), ((J, K), 2), ((, Y), 5), ((K Z), 6. ((P, R),3), ((P.?. 5), ((a x), 4), ((Q Zj 4), ((R, Y), 1), ((X, Z), 6)). 2. Do thefollowing problems a. Draw the weighted graph wG b. Draw an adjacency matrix representation of wG c. Draw a linked list implementation of the adjacency list representation of wG d. Find the least cost path from node A to all the other nodes, using Dijkstra's algorithm. e. Sort the weight values in the second position of each 2-tuple node weight, using (x1) Treesort, f. g. (x2) Quicksort, and (x3) Mergesort. Use a hash table (of size 10) to store all the edge weights of wG Use a heap to store the weight values in the first position of each 2-tuple node weight. 3. Explain what it means to state that a graph algorithm for a graph G-