Suppose that Edna, Harpo, and Pat wish to share some food between them. They have 1500 calories ofbread, 1000 calories of beef, and 500 calories of broccoli, and they each need 1000 calories of food. However, Edna does not eat broccoli, Harpo will not eat beef, and Pat cannot eat bread. There are many ways tomeet these constraints and give them all enough food, and it is easy to find a solution. The goal of thisproblem is to model the space of all solutions as a maximum flow problem. Draw an input to a flow problem (a directed graph with a capacity on each edge) that has a vertex for eachperson, a vertex for each type of food, a source vertex s, and a destination vertex t. Your network should have the property that, for any maximum flow, the flow amount from each food type x to each person y can be used as the amount of food of type x to give to person y in an assignment of food meeting the constraints above, and that every valid assignment of food can be modeled by flow amounts in this way.