Question 1: For the graph below, find the maximum flow from source to sink with shortest augmenting path algorithm. Also find the cut whose capacity equals the maximum flow in the graph. 3 5 6 5 2 7 2 S 5 2 6 4 6 Question 2: Four workers are available to perform jobs 1 to 4. Unfortunately, three workers can do only certain jobs: Worker 1, only job 1; Worker 2, only job 1 and 2; Worker 3, only job 2, Worker 4, any job. Draw the network for the maximum flow problem that can be used to determine whether all jobs can be assigned to a suitable worker. If not, please explain the reason