We have a list of $$ tasks, each with a deadline and a worth. Each task takes one day to complete and cannot be completed after its deadline. Denote the days as $1,2,3,...,$ and each deadline is a day number. Describe a greedy algorithm for the problem and prove that it always finds an optimal solution. Hint: Adapt the proof of the lecture hall problem from class.