Question #4 Consider the graph shown below with matching shown by the dashed lines. 7 13 11 12 3 10 a. Specify an alternating path of length 7. b. Using the labeling algorithm, find a blossom starting at vertex 10. C. Using the M-augmenting path algorithm, find a maximum matching. d. Policemen's problem: Suppose the graph above represents the street map of a small town. A policeman standing in the middle of a street can survey the crossings at the two ends of the street. What is the smallest number of policemen needed to survey all the crossings in the network? Question #4 Consider the graph shown below with matching shown by the dashed lines. 7 13 11 12 3 10 a. Specify an alternating path of length 7. b. Using the labeling algorithm, find a blossom starting at vertex 10. C. Using the M-augmenting path algorithm, find a maximum matching. d. Policemen's problem: Suppose the graph above represents the street map of a small town. A policeman standing in the middle of a street can survey the crossings at the two ends of the street. What is the smallest number of policemen needed to survey all the crossings in the network