Draw the resulted undirected graph represented by the adjacency matrix below. Please show the edges' weights on the graph. Q(1) a b c d e f g 7 3 2 8 7 3 8 0(2) Run Prim's algorithm on the resulted graph in Q(1) starting from node (a). Use an array (not a priority queue) for arrays dIn] and p[n], where n is the total number of nodes. Use the following table to show the values changes after each iteration. Initially all distances are (except the start node) and all parent nodes are null. Create a separate table for each progress step of executing the algorithm. Finally write the total edges' weight of the resulted spanning tree. Node a bdefg p null nul null llnull