Find a minimal spanning tree for the following weighed graph using Primm's algorithm. Fill in the table below. Prim's Algorithm: Start at N1 \begin{tabular}{|l|l} \hline Vertex Added & Unexplored vertices \\ \hline \end{tabular}