The diagram below represents a transshipment problem. Node A and B represent your manufacturing factories. Node C, D, 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. Using the information above, which of the following statement(s) are false? This transshipment model is balanced. The number of decision variables are represented by the number of nodes. Nodes A and B represent my origin nodes. In total, there would be 8 constraints excluding non-negativity. Both Aand D are false. Using the information above, how would you write the balance constraint for Node C in proper linear formatting? OAC + BC - CD - CF - CG = 0 9AC + 5BC - 7CF - 5CG = 0 9AC + 5BC - 3CD - 7CF - 5CG = 0 O 9AC + 5BC + 3CF + 7CF + 5CG = 0 O AC + BC + CD + CF + CG = 0Using the information above, how you write the constraint for Node B? O 5BC + 4BD + 10BE s 650 O 5BC + 4BD + 10BE = 650 O BC + BD + BE s 650 O BC + BD + BE - DE = 0