Write a program in Java to do the following....

Weighted Interval Scheduling Project 5 120 points Due Thursday November 9 Note. The Weighted Interval Scheduling problem is described in the posted file Memoization is described in the above file and more completely in the posted file Both of these files are posted in the folder "Lecture Notes". Weighted Interval Scheduling.ppt Chap04 Memoization.pdf This project must be done alone. The Weighted Interval Scheduling problem is this: Given a set of weighted intervals, choose a set of non-overlapping intervals such that the total weight is maximal. You may think of the "weight" as the profit for doing the work in the given interval A weighted interval x can be represented by a triple x=(s, f, u where s- start time of x, f- finish time of x, v- weight or profit of this job For example, consider the test case for Weighted Interval Scheduling problenm depicted below: 3 2 3 4 2 5 2 0 1 2 3 4 5 6 7 8 910