this is actually Operation Research. Plis answer all im waiting

Question 6 Not yet answered Marked out of 1.00 p Flag question The Burroughs Garment Company manufactures men's shirts and women's blouses for Walmark Discount Stores. Walmark will accept all the production supplied by Burroughs. The production process includes cutting, sewing, and packaging. Burroughs employs 25 workers in the cutting department, 35 in the sewing department, and 5 in the packaging department. The factory works one 8-hour shift, 5 days a week. The following table gives the time requirements and profits per unit for the two garments. Determine the optimal weekly production schedule for Burroughs. Garment Minutes per unit Sewing 70 Unit profit (5) Cutting 20 Shirts Packaging 12 8 Blouses 60 60 4 12 Select one: a. Shirts = 857.14; Blouses = 0; Total Profit = $10,285.71 b. Shirts = 8; Blouses = 14; Total Profit = $232 C. Shirts = 1200; Blouses = 0; Total Profit = $14400 d. Shirts = 480; Blouses = 840; Total Profit = $13,920 e. Shirts = 0; Blouses = 1000; Total Profit = $12,000 Question 7 Not yet answered A furniture company manufactures desks and chairs. The sawing department cuts the lumber for both products, which is then sent to separate assembly departments. Assembled items are sent for finishing to the painting department. The daily capacity of the sawing department is 200 chairs or 80 desks. The chair assembly department can produce 120 chairs daily and the desk assembly department 60 desks daily. The paint department has a daily capacity of either 150 chairs or 110 desks. Given that the profit per chair is $50 and that of a desk is $100, determine the objective function equation. Marked out of 1.00 P Flag question Select one: a. Minimize z = 50x1 + 100x2 b. Maximize z = 120x1 + 60x1 c. Maximize z = 60x1 + 120x2 d. Maximize z = 50x1 + 100x2 e. Minimize z = 20x1 + 80x2 Unbounded solution cases is if the objective value increase (maximum case) or decrease (minimization case) indefinitely. Question 8 Not yet answered Select one: Marked out of 1.00 True Flag question False We use Hungarian Algorithm to solve the Transportation Problem. Question 9 Not yet answered Marked out of 100 Select one: True False P Flag question Consider the assignment problem having the following cost table. Question 10 Not yet answered Task 1 2 3 Marked out of 1.00 P Flag question Assignee B 7 8 6 7 6 6 5 8 2 5 3 4 5 D 6 If the solution is optimum, then a. Assignee Cis assigned Task 3 b. Assignee A is assigned Task 3 c. There are no true answer d. Assignee B is assigned Task 3 e. Assignee D is assigned Task 3