Question $1$ : Graph Algorithms $..........................................................10$ points

$($a$)(5$ points$)$ Find the minimum spanning tree in the graph G$1$ using Prim$$s Algorithm $($start

from A$).$ Fill the table below with the contents of your priority queue after each remove