1 Six people, Andy, Bob, Colin, Dev, Eric and Faisal, are to be allocated to six tasks, \(1,2,3,4,5\) and 6 . The following table shows the tasks that each person is able to undertake.
| Person | Task |
| Andy | 1,3 |
| Bob | 1,4 |
| Colin | 2,3 |
| Dev | \(4,5,6\) |
| Eric | \(2,5,6\) |
| Faisal | 1,3 |
- Represent this information on a bipartite graph.
- Initially, Bob is allocated to task 1, Colin to task 3, Dev to task 5 and Eric to task 2.
Demonstrate, by using an alternating path algorithm from this initial matching, how each person can be allocated to a different task.