Problem 24. (10 points) Someone has performed several steps of the AugmentingPath algorithm on the network below. Each edge is labeled with the current flow on the edge and the capacity of the edge. Complete the performance of the algorithm (show enough work to convince me that you are using the algorithm). 3/4 8/10 5/5 6/6 3/3 Problem 25. (10 points) Assume that you are trying to assign jobs to people. The following table shows which people are suitable for which jobs (an X in row i, column j means person i can do job j). Currently, you have a (partial) matching consisting of {(P. J), (Pg, Ji), (Pa J.) (A, Js)). Using the technique shown in class (and in the book) draw the derived network and if possible find an augmenting path PX