2.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{00abfcc0-63b3-4784-a4b5-06aba234068c-3_616_561_278_356}
\captionsetup{labelformat=empty}
\caption{Figure 1}
\end{figure}
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{00abfcc0-63b3-4784-a4b5-06aba234068c-3_606_552_285_1146}
\captionsetup{labelformat=empty}
\caption{Figure 2}
\end{figure}
Figure 1 shows the possible allocations of six workers, Amrit (A), Bernard (B), Cameron (C), David (D), Emily (E) and Francis (F), to six tasks, 1, 2, 3, 4, 5 and 6
- Explain why it is not possible to find a complete matching.
Figure 2 shows an initial matching. Starting from this initial matching,
- find the two alternating paths that start at C .
- List the two improved matchings generated by using the two alternating paths found in (b).
After training, task 5 is added to Bernard's possible allocation.
Starting from either of the two improved matchings found in (c), - use the maximum matching algorithm to obtain a complete matching. You must list the additional alternating path that you use, and state the complete matching.
(3)