3. (a) Describe the differences between Prim’s algorithm and Kruskal’s algorithm for finding a minimum connector of a network.
\begin{figure}[h]
\captionsetup{labelformat=empty}
\caption{Figure 2}
\includegraphics[alt={},max width=\textwidth]{9ca3e12a-63fa-49c9-91fc-eedfb024417a-3_636_1219_482_358}
\end{figure}
(b) Listing the arcs in the order that you select them, find a minimum connector for the network in Fig. 2, using
- Prim's algorithm,
- Kruskal's algorithm.