The diagram below represents a transshipment problem. Node A and B represent your manufacturing factories. Node CD, and E represent your warehouses, Node F, G, and H represent your retail centers. Your supply for Nodes A and B are 500 and 650, respectively. The demand for Nodes F, G, and H are 400, 325, and 425, respectively. All decision variables should use the following format, AC, which represents the movement of product from Node A to Node C. Formulate a linear program where your goal is to minimize costs. The costs to move from one node to another are located above each line. F 5 3 A 10 B 10 8 E H Using the information above, how would you write the balance constraint for Node C in proper linear formatting? O AC + BC - CD-CF-CG=0 9AC + 5BC - 7CF - 5CG = 0 9AC + 5BC - 3CD - 7CF - 5CG=0 9AC + 5BC + 3CF + 7CF + 5CG=0 O AC + BC + CD + CF + CG=0