1.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{17bc9fb2-13bf-4ffa-93ac-bef170467570-2_611_629_360_717}
\captionsetup{labelformat=empty}
\caption{Figure 1}
\end{figure}
Figure 1 shows the possible allocation of six people, Alice (A), Brian (B), Christine (C), David (D), Elizabeth (E) and Freddy (F), to six tasks, 1, 2, 3, 4, 5 and 6.
An initial matching is Alice to task 1, Christine to task 3, David to task 4 and Elizabeth to task 5.
- Show this initial matching on Diagram 1 in the answer book.
(1) - Starting from this initial matching, use the maximum matching algorithm to find a complete matching. List clearly the alternating paths that you use, and give your final matching.
(5)