Need this ASAP

Linear Programming Problem: B&D Phones Corporation manufactures two models of smartphones, the Alpha 4 and the Beta 5. The firm employs five technicians, working 160 hours each per month, on its assembly line. Management insists that full employment (i.e., all 160 hours of time) be maintained for each worker during next month's operations. It requires 20 labor hours to assemble each Alpha 4 computer and 25 labor hours to assemble each Beta 5 model. B\&D wants to see at least 10Alpha4s and at least 15 Beta 5 s produced during the production period. Alpha 4 s generate $1,200 profit per unit, and Beta 5 s yield $1,800 each. Formulate and solve this LP problem using the corner point method to find the most profitable number of each model of smartphone to produce during the coming month. In your solution clearly define: 1- The decision variables 2- The objective function 3. The constraints 4. The graphical solution (Clearly show the constraints, feasible region, and corner points.) 5- The corner points (all possible solution points) 6. The optimal solution