2 Answer this question on the insert provided.
- Use Dijkstra's algorithm to find the least weight route from A to G in the network shown in Fig. 2.1. Show the order in which you label vertices, give the route and its weight.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{5d8d35b7-e4ba-4bc0-93a1-0cae58093a02-003_458_586_525_758}
\captionsetup{labelformat=empty}
\caption{Fig. 2.1}
\end{figure} - Fig. 2.2 shows a partially completed application of Kruskal's algorithm to find a minimum spanning tree for the network.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{5d8d35b7-e4ba-4bc0-93a1-0cae58093a02-003_417_524_1309_786}
\captionsetup{labelformat=empty}
\caption{Fig. 2.2}
\end{figure}
Complete the algorithm and give the total weight of your minimum spanning tree.