Solution :-
1.) Earliest finishing interval is the optimal greedy solution so there is no counter case.
2.) Take the example of 3 intervals (2,12), (3,5) and (6,9) then using earliest start time algo we can only choose (2,12) but optimal solution will be 2 (choosing (3,5) and (6,9) ).
3.) Take the example of following intervals :- (2,9), (3,6), (8,12), (10,17), (15,19)
using given algorithm we will choose pairs (2,9) and (10,17) because of having minimum gap interval and then discard the others because they are not compatible with these.
But optimal answer is 3. we can choose the intervals (3,6), (8,12) and (15,19).
If you like the solution please give it a thumbs up!! and if have further queries please write in the comment section.
Consider the following greedy strategies for this problem: 1. Select the earliest finishing interval and discard...