https://github.com/badriadhikari/Algorithms-2020fall/blob/master/homeworks/Homework04.md

1. The activity selection problem is defined as a combination-based optimization problem, where the selection of non-intersecting activities to perform within a given time frame are concerned, given a set of activities each marked by a start time (sᵢ) and finish time (fᵢ). The problem is to select the maximum number of activities that can be achieved in a given time slot, assuming that only one activity can be done at one time. Example car rental company with the following activity map:
A list of different activities with starting and ending times.
{(5,9), (1,2), (3,4), (0,6), (5,7), (8,9)}
Output:
Selected Activities are:
Activity: 0 , Start: 1 End: 2
Activity: 1 , Start: 3 End: 4
Activity: 3 , Start: 5 End: 7
Activity: 5 , Start: 8 End: 9
2. Code attached
3. The iterative greedy activity selection algorithm has a running time of...