Need this done ASAP PLEASE!

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 10 Alpha. 4s and at least 15 Beta 5s 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. The decision variables: Let X= number of Alpha 4 computers Y= number of Beta 5 computers Refer to this problem to answer the following questions: - Note when finding the total hours, remember that there are 5 workers, and each of them is working 160 hours. Subject to the following constraints: Labor hours constraint: x+ Y hours Minimum production constraint for Alpha 4: X Minimum production constraint for Beta 5: Y Non-negativity Constraints: X There are corner points in this problem. Corner points: point a : X= Y= profit = point b : X= ,Y= profit = The optimal solution is point