Assume we assign a weight to each activity in our scheduling…

Assume we assign a weight to each activity in our scheduling problem. This weight is an integer value that represents the priority of the activity – higher values correspond to higher priorities.  To generate the optimal set of activities A, we optimize the scheduling algorithm based on activity finishing time fa and activity priority weight wa using the following approach:

Given the start and finish times of activities ai shown in t…

Given the start and finish times of activities ai shown in the graph below, enter the number of the first two activities (values i separated by a comma) that adhere to the greedy strategy of selecting non-overlapping activities with the longest interval.