Question 1 - A-Level Maths

Draw a bipartite graph representing the following adjacency matrix.
1 2 3 4 5 6
\(\boldsymbol { A }\) 1 0 1 0 1 0
B 0 1 0 1 0 0
\(\boldsymbol { C }\) 0 1 0 0 0 1
\(\boldsymbol { D }\) 0 0 0 1 0 0
E 0 0 1 0 1 1
\(\boldsymbol { F }\) 0 0 0 1 1 0
Initially, \(A\) is matched to \(3 , B\) is matched to \(4 , C\) is matched to 2 , and \(E\) is matched to 5 . Use the maximum matching algorithm, from this initial matching, to find a complete matching. List your complete matching.
\begin{center} \begin{tabular}{|l|l|} \hline \multirow[t]{3}{*}{\begin{tabular}{l}