Consider the following graph.

$1.$ Compute a minimum spanning tree of the above graph using Prim's algorithm. Fill a table with all the steps table so that each row will contain the key and parent values at a step of the algorithm. Start with A$1.$ Draw the spanning tree.

$2.$ In the same graph above, use Dijkstra$$s algorithm to compute a shortest path tree rooted at A$1.$ Provide a table step by step and also draw a diagram

i need two tables and two diagrams