b$)$ For the task scheduling problem that we described in class, we saw that the greedy algorithm which selects the task with earliest starting time is optimal. This is the one you used for $($a$).$ Consider a different greedy algorithm, where we instead select the one with the latest finish time. Prove that it too yields an optimal solution. This should be a proper proof, following examples in earlier homework solutions and in textbook.

Hint: try applying this algorithm to tasks in $($a$),$ and to other task scheduling examples in the textbook