Q2) Run Prim's algorithm on the resulted graph in Q(1) starting from node (a). Use an array (not a priority queue) for arrays d[n] 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 b c p nunnu null Q2) Run Prim's algorithm on the resulted graph in Q(1) starting from node (a). Use an array (not a priority queue) for arrays d[n] 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 b c p nunnu null