Please answer all questions, I'm posting part two as well.

Question 1 (1 point) You have 9 tasks you would like to complete, and each task takes 1 hour to complete. You also have a deadline you must complete the tasks by, otherwise you will not get paid for the task. The tasks are lists below by Task Number, Amount of Pay you will get for completing, and Deadline for the task. Task 1, $15, hour 7 Task 2, $20, hour 2 Task 4, $30, hour 5 Task 4, $18, hour 3 Task 5, $18, hour 4 Task 6, $10, hour 5 Task 7, $23, hour 2 Task 8, $16, hour 7 Task 9, $25, hour 3 You can do the tasks in any order, what is the most money you can make? Save Question 2 (1 point) Mergesort is an example of which type of algorithmic approach. 1) Dynamic Programming 2) Greedy Method 3) Divide and Conquer 4) Backtracking Save