4. Consider the interval scheduling problem: We are given a set, R, of n activity requests for a resource, with each request specified by a start and finish time given by Sf;) for 1sisn. We say that two requests i and j conflict if their start-finish intervals overlap. In other words, [s.f.)n[s;:5})=0. If there is no overlap, we say that the two activities are compatible. One approach to solving this scheduling problem is the Earliest Activity First approach: KEY IDEA: Consider activities in increasing order of start time, and repeatedly select the activities that are compatible with previously selected activities. a. Develop this algorithm more precisely. (5 points) Algorithm EarliestFirst ( Input: Output: process