Explain this question with solution

#1

explain this question with solution

#2

A basic activity selection problem uses Greedy approach.Here, you need to sort the activities in the increasing order of their finishing times. Initially, we choose the first activity. Now, starting from second activity, current activity can be selected if the finish time of previous selected activity is less than or equal to the starting time of current activity.