2. (2 points) Consider the following different greedy algorithm for the Interval Scheduling algorithm: DifferentGreedySchedule - Initialize R to contain all intervals - While R is not empty - Choose an interval (S(i), F(i)) from R that has the largest value of S(i) - Delete all intervals in R that overlaps with (S(i), F(i)) Prove or disprove: The above greedy algorithm always produces an optimal solution