In: Computer Science
1. Given the following weighted intervals in form of (si, fi, vi) where si is the start time, fi is the finish time, and vi is weight, apply the DP algorithm you learn from lecture to compute the set of non-overlapping intervals that have the maximum total weight. (5, 12, 2) (7, 15, 4) (10, 16, 4) (8, 20, 7) (17, 25, 2) (21, 28, 1)
1) Show the dynamic programming table that computes the maximum total weight.
2) With above computed table, show the steps to determine the set of non-overlapping intervals that have the maximum total weight.
PLEASE GIVE IT A THUMBS UP, I SERIOUSLY NEED ONE, IF YOU NEED ANY MODIFICATION THEN LET ME KNOW, I WILL DO IT FOR YOU