An alternative greedy choice is to select the task with the latest start time

first. Explain why this greedy choice will give an optimal solution. Use the same

proof technique we used for the fractional knapsack problem to prove the greedy choice property.