Solve the following problem using Ford-Fulkerson technique to find the Maximum flow from Node A to Node K. The starting Path must be A-C-G-F-K shipping 11 units. In the space provided below, type each step (path) as you solve the problem. The answer will show your steps (including backflows, if any). This will be graded manually, so you'll not know if your answer is correct or not until the due date. However, you can change your answers during each try.