Problem 5. (10 points) Assume you have coins with denominations 5 cents, 10 cents, and 25 cents (nickel, dime, quarter) Use dynamic programming to determine the number of different ways to make a total of 50 cents (show enough work to convinnce me that you are using dynamic programming). Problem 6. (10 points) The graph below represents a network with a flow. Perform 2 augmentation steps (show enough work to convince me that you are using te Augmenting-Path algorithm) 3/5 6/6 5/5 2/4 1/5 5/5 5/6 Problem 7. (10 points) The graph below represents a network with a preflow. Perform 5 steps of the Preflow-Push algorithm (show enough work to convince me that you are using the Preflow-Push algorithm) S 7 06