Question 1 - A-Level Maths

Draw a bipartite graph to represent the following adjacency matrix.
1 2 3 4 5
A 0 0 0 0 1
\(\boldsymbol { B }\) 0 0 0 1 1
\(\boldsymbol { C }\) 0 1 0 1 1
\(\boldsymbol { D }\) 0 0 0 1 1
\(\boldsymbol { E }\) 1 1 1 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)