Let S = {a , a , a , , a }

Let S-a1, a2, . . , alo be a set with n-10 activities. The start time and the finish time of each activity is shown in the table below. Apply the GREEDY-ACTIVITY- SELECTOR function learned in class. What is the subset of activities returned? Write the activities in the correct order in which they are selected by the algorithm. S f a1 5 11 a2 915 15 |13 a4 8 10 a8 27 ag 11 14 Hint: Read carefully the "Note" after the GREEDY-ACTIVITY-SELECTOR function in Module 8.3 pdf "f they (the activities) are not sorted, then we have to sort them irs