the answer should be in details please .. please don't silve only the multiple choice s.. thanks

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 N, N, and Nz. 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 Mz in department M and module Nz 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 week, salary to the tutors at full capacity in a week, 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. DEGREEDEGREEDEGREE TUTOR TIME AVAILABLE PER Cost of tutors per semester at A B SEMESTER(Minutes) full capacitya M1 3 3 5000 250 M2 6 6 6 10000 500 N 5 8 8000 400 N2 4000 200 Ng 9 5 5600 280 Resource 0.4 0.5 cost College 13 13 17 Fee Resource table 10 5 0.3 1. Choose the objective function. (45% Marks) 2 Constraints for tutor M: (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 marka 02.1042-101544000 0,6x3+16+6x5+6+6+6x9-10000 D 112+136-1635+10x1200 Od All the variables are negative All the variables are non negative max = 12x1 +*242+1223+12x6+12x5+2x6+12x7+1228+1619 0 0 3x+3x2+623+5x765000 ON9x2+914+53625600 031+x25x+102755000 max Z- 13x1+12x2+1663 6x2+5+166+9+102 10000 DI 512+10x5+2x854000 Om One of the Constraint is not given Ormax max 2 - 12x1+122-120+124-12x5+126 Do. Objective function is not give 2.6245524000 Damar 2 120-1212-1333*124*12:5*5*6*77-6x=1169-77810 DE 3x+6x2+3x3+607-5000 Os 3x634+4x76x38000 13x16x+607-3520000 Ou56154+8x7+8x6000 OX,6X4+65+6+6x8+639670000 O w 18:3+18x6+10x9511200 O Some variables se negative x 6x6+5x5+10x6+5x3+x210000 3x+3x23x3-3x25000 All the constraints are not given