Need Code in python for generate timetable and calculate penalty Each day (D1, D2 and D3) has two meeting slots (S1 and S2), and each slot has two meeting rooms (R1 and R2). also have ten researchers must attend the following meetings (P1-P8). The projects that each researcher is working on are listed below: Adi: P1, P3, P6, P2 Ahmad: P2, P3 Ali: P2, P3, P5, P8 Ann: P4, P6 Debs: P6, P1 John: P6, P1, P3, P4 Lee: P7, P8 Linda: P7, P5 Maria: P1, P2 Sophia: P8, P7, P5, P6

first : Create a suitable constructive heuristic for these project meetings using a graph-based technique so that all researchers can attend them without conflicts.need code to generate timetable Second: calculate the penalty 1-n penalty is given if the researcher is idle (does not attend a meeting between two meetings) for n timeslots (i.e., n=1,2,3,...).

2- If a researcher has only one meeting scheduled per day, they lose one point (whereas he actually has more than one project meeting).

3- For every day D1 or D2 when a room is unoccupied, there will be a twopoint penalty (not reserved for a meeting).