1.
\begin{figure}[h]
\captionsetup{labelformat=empty}
\caption{Figure 1}
\includegraphics[alt={},max width=\textwidth]{e64b50bc-13a3-4051-b8c1-d4e7ea49e3a5-2_770_794_434_607}
\end{figure}
The bipartite graph in Figure 1 shows a mapping between six people, Andy (A), David ( \(D\) ), Joan \(( J )\), Preety \(( P )\), Sally \(( S )\) and Trevor \(( T )\), and six tasks \(1,2,3,4,5\) and 6.
The initial matching is \(A\) to \(2 , D\) to \(1 , J\) to 3 and \(P\) to 4.
- Indicate this initial matching in a distinctive way on the bipartite graph drawn in the answer book.
- Starting from this initial matching, use the maximum matching algorithm to find a complete matching. List clearly the alternating paths you use.
(5)