Suppose that you face a version of the network flow problem in which vertices as well as edges have capacities, i.e., if a vertex v has capacity c(v) then the flow into it cannot exceed c(v). Edge capacities have the usual meaning (as explained in the lecture slides). Explain how software for solving the version of network flow presented in the lecture (in which only edges have capacities) can be used to solve this new version of the problem. You are not allowed to change the internals of the software, the only control you have is over what input you give it, and how you obtain your answer from its output.