Choose all the correct answers to get full mark. A college offers produces three different degrees, A, B and C. Each Student needs to attend and examined by two departments M and N. Department M has two tutors teaching the modules M, and M2, while N has three tutors teaching the modules N1 , N2 and Ng. Degree A can be awarded to any student who passes any one module examinations in the departments M and one module in department N. Degree B can be awarded to any student who passes any one module in department M and module N, in department N. Degree C can be awarded to any student who passes the module M2 in department M and module N3 in department N. Time taken to award a degree to one student from each department is given in table below. The table also shows total available tutor time per week, module fee is given in table below. The table also shows total available tutoring hours per semester, salary to the tutors at full capacity, cost of resources required per student and college fee per degree. How many of each type of degree can be awarded from which department so as to maximize the net profit of the college? Assume that every student passes the module in their first attempt. Formulate the Linear programming problem. TUTOR TIME Cost of tutors per AVAILABLE PER DEGREE A DEGREE B DEGREE C semester SEMESTER at full capacity (Hours) M1 4 5000 250 M2 5 4. 10000 500 M2 N1 N2 N3 Resource cost College Fee 5 4 10000 500 3 8 8000 400 4 4000 200 11 8 5600 280 0.3 0.4 0.5 14 14 18 Resource table 1. Choose the Objective function. (45 % Marks) 2. Constraints for tutor M1 (10% Marks) 3. Constraints for tutor M2 ( 10% Marks) 4. Constraints for tutor N, ( 10% Marks) 5. Constraints for tutor N2. (10% Marks) 6. Constraints for tutor N3 ( 10% Marks) 7. Remaining constraints. (5% Marks) Choose exactly seven answers. Any wrong choice will get negative marks. O a. 4x1+4x4+8x7+5x828000 O b. 5x2+8x524000 O c. 5x2+3x4+4x6+11x8+8x10 2 10000 O d. 5x4+5x5+5x6+4x8+5x9S10000 O e. 4x1+4x2+8x3+5x7