Question: Determine the maximum flow from Node 1 ( N 9th Street \& P Street) to Node 6 (Holdrege Street \& N 35 th Street) using the Ford-Fulkerson Algorithm (i.e., the algorithm covered in class for maximal flow problems) or through mathematical modeling. Report each complete path assumed in the algorithm or identified by the mathematical model as an efficient bus route. Present the bus routes and the maximal flow that your solution identifies