Here is a bipartite graph, showing the 7 sources, 6 targets, and all 12 edges: A1, A2, B1, B6, C3, D3, D4, E6, F4, F6, G6. Each edge represents a legal assignment of a source to target.

Trace the matching algorithm on this graph. Do the algorithm systematically- your outer loop should go through the sources in alphabetical order, and when choosing a possible target always choose them in numeric order EVEN IF THEY ARE NOT IMMEDIATELY AVAILABLE.

After each source has been handled by your outer loop, give a list of ALL the current assignments.( For example, after the first time, there will be only one current assignment, namely A1. So you will show 7 separate lists.

you just need to trace the matching algorithm.you dont have to write the algorithm or code.we have to write all the 7 stages that follow matching algorithm.