In: Computer Science
Recall the activity selection problem where you find the maximum subset of non-overlapping activities by selecting the activities in increasing order of their finish time. Suppose that instead of always selecting the first activity to finish, we instead select the last activity to start that is compatible with all previously selected activities. You think this will always yield an optimal solution for activity selection problem? If no give a counter example. Otherwise give correctness proof.
SOLUTION:-
==============================================================================