Question 1 This question is about greedy approaches to problems. One of your friends, Kishan, is looking to choose some units for their next semester that will let them attend all of their classes. This means they wish to choose units which do not have clashes (where two units have classes with the same start and end time or overlap for some amount of time). Fortunately, each unit's timetable is listed in advance to help students choose their units (see Figure 1) Kishan has asked for your help in choosing units for him to sign up for so that they can choose the most units that result in zero clashes. Note: You may ignore any prerequisites or other restrictions in choosing units for this Problem Note2: You may assume each unit only has a single time for each type of class (eg. One tutorial time rather than the choice of three) MONTUES WED THUR UNIT 9:00 10:00 UNIT 4 4 UNIT UNLE 10:00 - 11:00 UNIT 2 3 11:00 12:00 12:00 13:00Nr G UNITS I 1 UNIT 3 1 1 UNITS 13:00 14:00 Figure 1: example timetable