Consider the following weighted graph

a$,$Draw the resulting shortest path tree using Prim's Algorithm Starting A

MAtch the steps in sequence, showing which edges are added to form the minimum spanning tree

b$,$ Draw the resulting shortest path tree using Kruskal's Algorithm

c$,$ Draw the resulting shortest path tree using Dijkstra's Algorithm starting at A

Using the shortest path tree based on Dijkstra's Alg calculate the following:

$+$ the distance for each of the vertices from A $($Given A is $0)$

$+$ theh parent of each note $($A is null$)$

$+$ The dequence sequence $($A is $1,$ the reset would be $2,3,4,5,6$ in the order in which the vertice are dequeed and added to the tree$)$