Wheat is harvested in the Midwest and stored in grain elevators in three different cities: Kansas City, Omaha and Des Moines. These grain elevators supply three flour mills, located in Chicago, St. Louis and Cincinnati. Grain is shipped to the mills in railroad cars. The cost of transporting one ton of wheat from each grain elevator to each mill differs according to the distance and rail system. These costs are shown in the following table. For example, the cost of shipping one ton of wheat from the grain elevator at Omaha to the mill at Chicago is $7. Each grain elevator is able to supply the following number of tons (i.e., railroad cars) of wheat to the mills on a monthly basis: Each mill can handle at most the following quantities of wheat per month: The revenue on each ton of wheat sent to a mill is $20 per ton (it is the same for all three mills). Determine how many tons of wheat to transport from each grain elevator to each mill on a monthly basis in order to maximize total profit. Answer the following questions Question 1) Consider the Linear Programming formation of this problem. How many decision variables are there? Question2) Consider the Linear Programming formation of this problem. How many constraints are there (not counting the nonnegativity constraints)? Question 3) Provide your Linear Programming formation for this problem. Make sure to provide a clear and precise definition for your decision variables. Question 4) Use the greedy method to solve this linear program