Consider the following greedy algorithm for a bipartite graph matching problem (a) Pick an edge with the largest weight and add it to the matching (b) Remove all edges from the graph that conflict with the edge picked in (a): (c) Repeat step (a) and (b) in the remaining graph until the remaining graph is empty. Such a matching is called a greedy marimal matching. Find two greedy maximal matchings in the graph below. 3 2