Thumb up for the solution, thx!

5. a. Consider an undirected graph G as shown in Figure 2. Represent the graph G in the form of cost adjacency matrix. Then show graphically its adjacency linked list representation Figure 2 23 131 15 19 b. Draw the minimum cost spanning tree of G, which can be obtained by applying Prim's algorithm. State the sequence of edges selected by the algorithm in the proper order for inclusion in the minimum cost spanning tree. c. Give the depth-first traversal of the graph below, starting from vertex A (show steps)