Question $8.$ Give the table of the Prim's algorithm and then find $t$ he e dges of $t$ he minimum spanning tree of the following weighted graph starting at the vertex $v_1.$ Do not draw just the minimum spanning tree write the Prim's table of each iterations.

Give the table of Dijkstra$$s algorithm starting at the vertex v$1$ then find the minimum path tree. Write the Dijkstra$$s table of each iterations.

Give table of Dijkstra$$s algorithm starting at the vertex v$4.$ Write the Dijkstra$$s table of each iterations.