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.

The water has been on the stove y=9.5x+62.1 after how many minutes will the tempature be 138.1 f

Suppose you are going to graph the data in the table. minutes temperature (°c) 0 -2 1 1 2 3 3 4 4 5 5 -4 6 2 7 -3 what data should be represented on each axis, and what should the axis increments be? x-axis: minutes in increments of 1; y-axis: temperature in increments of 5 x-axis: temperature in increments of 5; y-axis: minutes in increments of 1 x-axis: minutes in increments of 1; y-axis: temperature in increments of 1 x-axis: temperature in increments of 1; y-axis: minutes in increments of 5

45 was divided by a power of ten to get 4.5. what power of ten was it divided by? people 4.5