Q) In the attached figure consider the set of activities (See the figure) .

Construct the intersection graph of these activities and determine its chromatic number, which is the solution to the Lecture Hall assignment problem for the set of activities

RECURSIVE-ACTIVITy-SELECTOR(s.f, 0, 11) RECURSIVE-AcTiVITY-SELECTOR(S.f1, 11) aI :RECURSIVE-ACTIVITY-SELECTOR(s,f,4, 11) 7 6 10 m 8 RECURSIVE-ACTIVITY-SELECTOR (s,f 8, 11) do 9 8 12 cI 10 2 14 cI 11 12 16 RECURSIVE-ACTIVITY-SELECTOR (s,f 11, 11) (a time 0 23 5 6 7 8 910 11 12 13 14 15 16 Figure 16.1 The operation of RECURSIVE-ACTIVITY-SELECTOR on the 11 activities given ear- lier. Activities considered in each recursive call appear between horizontal lines. The fictitious activity ao finishes at time 0, and the initial call RECURSIVE-ACTIVITY-SELECTOR(s, f, 0, 11), se- lects activity a1. In each recursive call, the activities that have already been selected are shaded, and the activity shown in white is being considered. If the starting time of an activity occurs before the finish time of the most recently added activity (the arow between them points left), t is re- jected. Otherwise (the arrow points directly up or to the right), it is selected. The last recursive call, RECURSIVE-ACTIVITY-SELECTOR(s, f, 11, 11), returns . The resulting setof selected activities is a1.a4. as.a11