a$.$ Use Dijkstra's algorithm to find the shortest path from vertex $A$ to all other vertices. Use the table below to show all iterations:

$\backslash$table$[[$Vertex$,$Known,dv$,$p$\_($v$)],[$A$,,,],[$B$,,,],[$C$,,,],[$D$,,,],[$E$,,,],[$F$,,,],[$G$,,,],[$H$,,,]]$

b$.$ From $($a$)$ list the minimum distance and the shortest path for the A$-$D$.$

c$.$ State the edges in the Minimum Spanning Tree which would be found by Prim's Algorithm if it started with vertex $A.$ List the edges in the order in which they would be added by the algorithm.