2. 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 N3. Degree A can be awarded to any student who passes any one module examinations in the departments Mand 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 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 semester, 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 DEGREE A DEGREEB DEGREEC TUTOR TIME AVAILABLE PER SEMESTER (Hours) 5000 Cost of tutors per semester at full capacity M1 3 3 250 6 6 5 10000 500 N 6 7 8000 400 N2 5 4000 200 9 11 5600 280 0.3 0.4 0.5 Resource cost College Fee 13 13 25