(a) Reduce the BIPARTITE MATCHING problem on G to a max-flow instance and show its max flow. You do not need to show how you found the max flow. (b) Use G to illustrate the min-max theorem for bipartite matchings, i.e., show the witness that demonstrates that your bipartite matching has maximum cardinality, and explain why the witness proves this fact.[6 marks]

Fig: 1

Fig: 2