Please zoom in if you have trouble reading the question

GREEDY-ACTIVITY_SELECTOR

Let S = {a_1, a_2, a_3, .., a_10) 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. Greedy - Activity - Selector(s, f) n = s.length A = {a_1} K = 1 for m = 2 to n if s[m] greaterthanorequalto f[k] A = A Union {a_n} K =m return A