Algorithm Question

In this question we will look at the Interval scheduling problem. The problem consists of a set of tasks. Each of these tasks need to be executed in a specific time interval. Each task is also assigned a value. Two tasks are set to be compatible if their time intervals do not overlap. Using the following table, what is the end value achieved by a scheduler that take a first come first serve approach to completing the task list? (In other words, the scheduler makes a greedy choice based on the earliest start time. [Note: If the scheduler finds the solution to be Task 1 and Task 2, the end value would be 2+5 = 7 (the sum of the values of the tasks included in the solution).] Task Start time End time Value 1 1 3 2 2 2 3 5 3 4 7 2 14 6 8 15 5 8 10 1 6 9 10 120 Using the table from the previous question, what is the max value achievable by a scheduling algorithm