Suppose that we have a set of activities to schedule among a large number of lecture halls, where any activity can take place in any lecture hall. We wish to schedule all
the activities using as few lecture halls as possible. Give an efficient greedy
algorithm to determine which activity should use which lecture hall. Find the time
complexity of this algorithm.

-14 is the answer

hope this : ))

898.1666667

step-by-step explanation:

5389/6 = 898.1666667

constant of proportionality = 3 and the equation is c = 3p.

step-by-step explanation:

c = kp   where c = amount of caffeine in mg., p = oz of pepsi and k is the constant of proportionality.

substituting the values given:

24 = 8k

k = 3.

the same value of k will be obtained if we substitute the other given values.