Consider the dynamic programming algorithm we discussed for the weighted interval scheduling problem. Show the trace of running a bottom-up (i.e., iterative) implementation of the algorithm on the problem instance shown below. Show the trace. Remember to number the jobs in the increasing order of their finish times.

5 8 7 4 Time 0 2 3 456 78 9 10 11 Each bar shows the start time and finish time of a job. The number in a bar is the value of the job