7. Here is a description of the Interval Scheduling Problem. You have a set S of n requests, S-,2,..nj. Each request i corresponds to an interval of time that starts at s(i) and finishes at f(i). A subset A of S is compatible if no two requests overlap in their time intervals. The problem is how to select a compatible subset A that contains the maximum number of requests. Because we want to maximize
OR
OR