Show your knowledge of the alternating path algorithm by following the steps to find a maximum bipartite matching. Three copies of the bipartite graph are given so you can clarify the order in which you do steps. Write comments for further clarifications, if needed. Proceed in alphabetical order to match a vertex on the left (if possible) that is so far unmatched. Consider possible matching vertices on the right in numerical order. Try to make a single-edge match if one exists, but if that does not work, try to make an alternating path. Show your knowledge of the alternating path algorithm by following the steps to find a maximum bipartite matching. Three copies of the bipartite graph are given so you can clarify the order in which you do steps. Write comments for further clarifications, if needed. Proceed in alphabetical order to match a vertex on the left (if possible) that is so far unmatched. Consider possible matching vertices on the right in numerical order. Try to make a single-edge match if one exists, but if that does not work, try to make an alternating path