Think about the following timetabling issue. A researcher may participate in numerous projects. Based on their projects, 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

Each day (D1, D2 and D3) has two meeting slots (S1 and S2), and each slot has two meeting rooms (R1 and R2). That is, we can have two meetings in parallel. The researchers must be scheduled to attend all of their project meetings on those days without conflict.

question:Create a suitable constructive heuristic for these project meetings using a graph-based technique so that all researchers can attend them without conflicts. Write a pseudocode or flowchart of your algorithm.