COPY THE ANSWER ON HERE OR TRY TO SPAM CODING ANSWER AND YOU WILL BE REPORTED

Problem 3 (15 points]: In class, we showed upper bounds on the number of push and relabel operations in the push-relabel algorithm, but did not specify the time complexity of a single operation. Give an implementation of the push-relabel algorithm that has a run time of 0(mn + k), where k denotes the number of unsaturating pushes. (Hint: For each vertex with non-zero excess flow, maintain an arbitrarily ordered list of edges leaving the verter, and show that between any two consecutive relabels of the verter, its edge list is sequentially scanned exactly once. Your focus should be to show that the time taken by your implementation to perform all saturating pushes is 0(mn))