Consider the following timetabling problem. Ten postgraduate (PhD) students are required to present their research progress to the following panels. STUDENT (S) SUPERVISOR 1 S1 A8 2 S2 A5 3 S3 A6 4 S4 A1 5 S5 A4 6 S6 A2 7 S7 A3 8 S8 A4 9 A 10 10 S10 A 11 PANELS (A) A1, A2, A3 A1, A2, A3 A3, A4, A5 A6, A7, A8 A6, A7, A8 A9, A 10, A11 A8, A9, A 10 A12, A13, A 10 A12, A13, A 14 A12, A13, A7 S9 The panels must be scheduled to attend all the student presentations that have been assigned to them without clash within two days (D1 and D2), where each day has three presentation slots, and each slot has two meeting rooms R1 and R2 (1.e. we can have two presentations in parallel). Supervisors are encourage (i.e. not compulsory) to attend their student presentation. a) Draw a graph to represent the phd research progress presentation problem. b) Design a suitable constructive heuristic using a graph based technique to schedule all panels such that they can attend all the student presentations that have been assigned to them without clash. Write a pseudocode or flowchart of your algorithm. c) The quality of solution is measured by summarizing the penalty value where: penaltx=2 is given if the supervisor cannot attend (clash) his/her student presentation penalty=1 is given if the panel has idle slot between the presentations that he need to attend(i.e. if the panel has two presentation + Write a programming code (you may use any programming language such as Python, Matlab, CH, Java, etc) to generate a solution using the proposed constructive heuristic (in (b)) and monstrate your solution with the value of the solution's quality. Write the comments appropriately in your code for readability. Consider the following timetabling problem. Ten postgraduate (PhD) students are required to present their research progress to the following panels. STUDENT (S) SUPERVISOR 1 S1 A8 2 S2 A5 3 S3 A6 4 S4 A1 5 S5 A4 6 S6 A2 7 S7 A3 8 S8 A4 9 A 10 10 S10 A 11 PANELS (A) A1, A2, A3 A1, A2, A3 A3, A4, A5 A6, A7, A8 A6, A7, A8 A9, A 10, A11 A8, A9, A 10 A12, A13, A 10 A12, A13, A 14 A12, A13, A7 S9 The panels must be scheduled to attend all the student presentations that have been assigned to them without clash within two days (D1 and D2), where each day has three presentation slots, and each slot has two meeting rooms R1 and R2 (1.e. we can have two presentations in parallel). Supervisors are encourage (i.e. not compulsory) to attend their student presentation. a) Draw a graph to represent the phd research progress presentation problem. b) Design a suitable constructive heuristic using a graph based technique to schedule all panels such that they can attend all the student presentations that have been assigned to them without clash. Write a pseudocode or flowchart of your algorithm. c) The quality of solution is measured by summarizing the penalty value where: penaltx=2 is given if the supervisor cannot attend (clash) his/her student presentation penalty=1 is given if the panel has idle slot between the presentations that he need to attend(i.e. if the panel has two presentation + Write a programming code (you may use any programming language such as Python, Matlab, CH, Java, etc) to generate a solution using the proposed constructive heuristic (in (b)) and monstrate your solution with the value of the solution's quality. Write the comments appropriately in your code for readability
