(Solved) : Given Set Intervals I1 Real Line Interval Ii Specied Start End Points Si Ti Respectively Q27450818 . . .
We are given a set of intervals I1;…;In on the real line. Eachinterval Ii is specied by the start and end points si and ti,respectively:
Ii = (si; ti)
Additionally, for each interval Ii, we are given a color ciwhich is either red, green, or blue.
We want to find a subset of intervals Aso that:
1-no two intervals in A intersect;
2-there is an equal number of red, green, and blue intervals inA;
3-the total length of all intervals in A is maximized.
Design a dynamic programming algorithm that nds the optimalsolution. Specically, do the following:
1. Dene the dynamic-programming table and explain the meaning ofits entries
2. Write the initialization step of your algorithm
3. Write the recurrence formula for computing entries of thetable
4. Prove the correctness of the formula
5. Find the running time of your algorithm
Expert Answer
Answer to Given Set Intervals I1 Real Line Interval Ii Specied Start End Points Si Ti Respectively Q27450818 . . .
OR