Sample output with notes

$++++$ Weighted Interval Scheduling with Bottom up dynamic programming $++++$

Enter number of Intervals : $6$

Enter Start time, Finish time and Weight separate by a space:

Si Fi Wi

$142$

$264$

$3,9,7$

$8,10,2$

$8,102$

$584$

$8,11,3$

Weighted Interval Schedules that entered from users are unsorted

intervals. You need to write a function to sort all intervals by its

finishing time.

Sorted Input Intervals by finishing time:

Maximum profit of non$-$overlapping scheduling is $9$

The jobs involved in the maximum profit are $(142),(584),(8113)$

You need to trace back to find the interval

jobs involved in maximum profit.