Greedy algorithms

Let's consider a situation where being greedy could help you earn extra money with some extra effort. Imagine one of your coworkers was ill, and there was a short window of time to complete some urgent tasks. Your boss provides you with a list of pending tasks with deadlines and asks you if you could finish some of them. For simplicity, let's assume that each task takes an hour to complete and that you are willing to devote three additional hours, from $4$ to $7$ pm, to work on them. However, the compensation varies depending on the task. Below is a list of the tasks and their rates, as well as their deadlines. The tasks are sorted in descending order of payments.

You want to choose the three tasks from the list that will maximize your earnings. Please match the time slots below with the appropriate task, and arrange the incomplete tasks in descending order of payments.