Read section $15\mathrm{.}1($An activity$-$selection problem$)$ from the bookYou are given a set of activities to schedule among a large number of lecture halls, where any activity cantake place in any lecture hall. You 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. Determinethe two elements of the greedy strateg