(20 points) Consider a network flow problem where the goal is to maximize the flow from source node s to sink t, but with an additional restriction that the total flow into a particular node of a network is restricted to 10 units or less. Show how such a problem can be converted into a maximum flow problem (without any additional restrictions) Hint: How can we represent this restriction via an are capacity constraint? Please help by showing all steps Cap-10 node 2 4 Capacity of 10 at node 2 should be the only needed information. The problem states without any additional restrictions. If you NEED the other restrictions, I have created the below. I would assume though that all nodes should be infinite if no other restrictions, and then convert to a maximum flow problem. Please provide all details on what is the approach? Cap. 10 node 2 10 4 (20 points) Consider a network flow problem where the goal is to maximize the flow from source node s to sink t, but with an additional restriction that the total flow into a particular node of a network is restricted to 10 units or less. Show how such a problem can be converted into a maximum flow problem (without any additional restrictions) Hint: How can we represent this restriction via an are capacity constraint? Please help by showing all steps Cap-10 node 2 4 Capacity of 10 at node 2 should be the only needed information. The problem states without any additional restrictions. If you NEED the other restrictions, I have created the below. I would assume though that all nodes should be infinite if no other restrictions, and then convert to a maximum flow problem. Please provide all details on what is the approach? Cap. 10 node 2 10 4