please show all work with steps. i am having a hard understanding the question. thanks

2) StrumDog Enterprises produces two models of automatic dog feeders. Model A requires 8 min of time on Assembly Line One and 12 minutes of time on Assembly Line Two. Model B requires 10 minutes of time on Assembly Line One and 6 minutes of time on Assembly Line Two. At most, 13 hours and 20 minutes of labor-hours of assembly time are available in Line One, and 14 labor-hours of assembly time on Line Two are available each day. It is projected that StrumDog Enterprises will realize a profit of $16 on each Model A feeder, and $12 on each Model B feeder. Maximum daily profit is to be determined. a) Set up the system of linear equations for this linear programming problem. Make sure to label each variable, and the objective equation as well. b) Solve via a graphical solution (scale your graph axes by 20s). Find the number of each model of dog feeder to be produced each day to maximize StrumDog Enterprises daily profit. Also, find the daily profit to be realized. C). Solve problem 2 using the Simplex Method. First, set up the equations with 'slack' variables. Second, set up the Initial Tableau. Finally, solve the system