6. Consider the following weighted graph G 3 9 12 6 a) List the nodes of G starting with A in the order in which they are settled in Dijkstra's algorithm. Show your work by giving, for each iteration, the settled node for the iteration and the distance to each unsettled node at the end of the iteration. b) List the nodes of G starting with C in the order in which they are settled in Dijkstra's algorithm. 7. Consider again graph Gw in problem #6. aList the edges in the order added by b List the edges in the order added by Prim's Kruskal's algorithm. algorithm when the initial chosen node is A. c) List the edges in the order added by Prim's algorithm when the initial node chosen is C