Sample output with notesObjectives: Solving Weighted Interval Scheduling with bottom$-$up dynamic programming

You will write a program to find the maximum weight of more than one non$-$overlapping schedules. The given data, explanation, pseudocodes and sample output are in the Dynamic Programming lecture which was posted on Canvas, module $2.$

You are encouraged to first work on the problem with paper $/$ pen until you get the correct result before actually programming.

Definitely, the program must have a struct or class to handle the input of intervals; a class WIS $($Weighted Interval Scheduling$)$ to handle other objects and its operations.

Expect to see three files: WISheader.h; WISimplementation.cpp and WISmain.cpp$.$ You can add more header or implementation files as necessary.

Keep in mind $$ There are many algorithms to solve this particular problem. For this assignment, we will use Bottom up Dynamic Programming technique. You will receive non$-$credit for using other methods.

PLEASE write in C$++$ and don't use CHATGPT!!!!!!!