1 Answer this question on the insert provided.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{c429bfed-9241-409a-9cd5-9553bf16c9df-2_658_739_466_662}
\captionsetup{labelformat=empty}
\caption{Fig. 1}
\end{figure}
- Apply Dijkstra's algorithm to the copy of Fig. 1 in the insert to find the least weight route from A to D.
Give your route and its weight.
- Arc DE is now deleted. Write down the weight of the new least weight route from A to D , and explain how your working in part (i) shows that it is the least weight.
[0pt]
[2]