1.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{87f0e571-e708-4ca9-adc7-4ed18e144d32-02_474_501_374_429}
\captionsetup{labelformat=empty}
\caption{Figure 1}
\end{figure}
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{87f0e571-e708-4ca9-adc7-4ed18e144d32-02_474_501_374_1133}
\captionsetup{labelformat=empty}
\caption{Figure 2}
\end{figure}
Figure 1 shows the possible allocations of six people, \(\mathrm { A } , \mathrm { B } , \mathrm { C } , \mathrm { D } , \mathrm { E }\) and F , to six tasks, \(1,2,3\), 4, 5 and 6
- Write down the technical name given to the type of diagram shown in Figure 1.
Figure 2 shows an initial matching.
- Starting from the given initial matching, use the maximum matching algorithm to find a complete matching. You should list the alternating paths you use and state your improved matching after each iteration.
(6)