3.
\begin{figure}[h]
\captionsetup{labelformat=empty}
\caption{Figure 2}
\includegraphics[alt={},max width=\textwidth]{75ea31c7-11e7-4dd9-9312-4cf32bba622b-04_1488_677_342_612}
\end{figure}
The bipartite graph in Fig. 2 shows the possible allocations of people \(A , B , C , D , E\) and \(F\) to tasks \(1,2,3,4,5\) and 6.
An initial matching is obtained by matching the following pairs
\(A\) to \(3 , \quad B\) to \(4 , \quad C\) to \(1 , \quad F\) to 5 .
- Show this matching in a distinctive way on the diagram in the answer book.
- Use an appropriate algorithm to find a maximal matching. You should state any alternating paths you have used.
(5)