A bakery has two locations (i =1,2) with the capacity to make qcupcakes each day. Cupcakes made in Bakery 1 can be sent directly to either of the store-front locations (j = 1,2) or through the packaging center that boxes the items. Cupcakes from Bakery 2 must go through the packaging center. The packaging center can only process P cupcakes per day and there is a cost of w per cupcake that is packaged there. Each store-front location has its own potential demand, Li, and you should assume that the total demand (for the combined store-fronts) is less than the total supply capacity (from the combined bakeries) of cupcakes. The cost to move cupcakes from bakery i to the processing center is ci. The cost to move cupcakes from the processing center to either store front is g. The cost to move cupcakes from Bakery 1 to store front j is kj. Model the problem of deciding how the company should send cupcakes from the bakery locations to the store-fronts as a Minimum Cost Network Flow problem by drawing the network diagram. Clearly label all of your nodes and arcs and include all associated data on your diagram A bakery has two locations (i =1,2) with the capacity to make qcupcakes each day. Cupcakes made in Bakery 1 can be sent directly to either of the store-front locations (j = 1,2) or through the packaging center that boxes the items. Cupcakes from Bakery 2 must go through the packaging center. The packaging center can only process P cupcakes per day and there is a cost of w per cupcake that is packaged there. Each store-front location has its own potential demand, Li, and you should assume that the total demand (for the combined store-fronts) is less than the total supply capacity (from the combined bakeries) of cupcakes. The cost to move cupcakes from bakery i to the processing center is ci. The cost to move cupcakes from the processing center to either store front is g. The cost to move cupcakes from Bakery 1 to store front j is kj. Model the problem of deciding how the company should send cupcakes from the bakery locations to the store-fronts as a Minimum Cost Network Flow problem by drawing the network diagram. Clearly label all of your nodes and arcs and include all associated data on your diagram