Formulate the following questions as a linear programming (LP) problem according to procedures in the examples shown in the class slides and audio visual lecture presentations. Valley Logistics Inc. (VLI) produces medium and large packaging boxes. Each medium packaging box requires 5 square feet of cardboard, while each large packaging box requires 8 square feet of cardboard. Cardboard is limited to 6100 square feet daily. Each box must pass through three departments during the production process. The departments are cutting, printing, and assembly departments. In the cutting department, each medium box requires 0.01 labor hour and each large box requires 0.02 labor hours. In the printing department, each medium box requires 0.05 labor hour and each large box requires 0.06 labor hours. In the assembly department, each box requires 0.12 labor hour regardless of size of box. Presently, cutting department has a maximum of 30 labor hours daily, printing department has a maximum of 70 labor hours daily, and assembly department has a maximum of 150 labor hours daily that can be assigned to the production of the two types of boxes. Due to warehouse limitations, no more than 400 large boxes can be made each day. Also, due to customer demand, at least 95 medium boxes must be produced. Medium boxes yield a profit of $18 each, and large ones yield \$29 profit each. Formulate this problem as a linear programming (LP) model, to determine the number of each type of packaging box to produce daily, that will maximize profit for VLI. (Only LP formulation is asked for, following the three steps discussed in the course slides and textbook.)