Appreciate if you can answer this ONE QUESTION COMPLETELY and give me a detailed working with explanation for me to understand. Once completed so long as my doubts are cleared and the solutions are correct, I will definitely vote up. Some of the question are similiar to take a look carefully before you answer as it's very important for me.

Thank you

Question 7 11 pts Consider the following bipartite graph G. 52 sg 93 ys a) Apply the maximum matching algorithm to G with initial matching M- Key in the following info in the required formats: When 1st breakthrough is reached: 2Y1. x X5y . x05 to find a maximum matching? The label of vertices in X bipartition is ? (Eg:("y1.N.y4,N) where "N" means no-label for the vertex) The babel of vertices in2Y bipartitionis When 2nd breakthrough or STOP is reached: ? (Eg: (x4,N,x2,Nx4,x1) where "N" means no-label.) The label of vertices in X bipartition is The label of verticesin ipartitios The maximum matching is: (Key-in the edges in alphabetical order, Eg. x1y1, x2y5, , X6y3).) (b) Is your maximum matching a perfect matching?? ? ("Y"for Yes, "N" for No) (c) Is it true that a perfect matching is always a maximum matching? Cfor Yes, "N" for No) (d) Is it true that a maximum matching is always a perfect matching? Y for Yes, "N" for No) Question 7 11 pts Consider the following bipartite graph G. 52 sg 93 ys a) Apply the maximum matching algorithm to G with initial matching M- Key in the following info in the required formats: When 1st breakthrough is reached: 2Y1. x X5y . x05 to find a maximum matching? The label of vertices in X bipartition is ? (Eg:("y1.N.y4,N) where "N" means no-label for the vertex) The babel of vertices in2Y bipartitionis When 2nd breakthrough or STOP is reached: ? (Eg: (x4,N,x2,Nx4,x1) where "N" means no-label.) The label of vertices in X bipartition is The label of verticesin ipartitios The maximum matching is: (Key-in the edges in alphabetical order, Eg. x1y1, x2y5, , X6y3).) (b) Is your maximum matching a perfect matching?? ? ("Y"for Yes, "N" for No) (c) Is it true that a perfect matching is always a maximum matching? Cfor Yes, "N" for No) (d) Is it true that a maximum matching is always a perfect matching? Y for Yes, "N" for No)