Question 1 - A-Level Maths

Draw a bipartite graph representing the following adjacency matrix.
1 2 3 4 5
\(\boldsymbol { A }\) 1 0 0 0 1
\(\boldsymbol { B }\) 0 1 1 1 0
\(\boldsymbol { C }\) 0 1 1 1 0
\(\boldsymbol { D }\) 1 0 0 0 1
\(\boldsymbol { E }\) 1 0 0 0 1
If \(A , B , C , D\) and \(E\) represent five people and \(1,2,3,4\) and 5 represent five tasks to which they are to be assigned, explain why a complete matching is impossible.
(2 marks)
\includegraphics[max width=\textwidth, alt={}]{fe9c0da0-40e3-4a87-ae9a-13ec0740ffff-03_2484_1709_223_153}