Reference no: EM133269866

In Python: Establish an activity selection criteria, using the greedy approach (backpack problem), choose an activity and then the next activity and so on, finish printing the longest time the processor will be active and with which selected activities it is obtained.

Do according to the following criteria:

1) There is a set S = (a₁, a₂,...,a_n) of n activities that want to use the same resource which can serve one activity at a time.

2) Each activity (a₁) has a start time (s_i) and an end time (f_i), such that: 0 <= s_i < f_i < ∞

3) If selected, the activity (a_i) and (a_j) are compatible if their intervals do not overlap, that is, s_i >= f_j or s_j >= f_i

4) In this problem, we wish to select a subset of mutually compatible activities of maximum size.