We are given a set of events (with starting and finishing times) that have to be scheduled in a…

We are given a set of events (with starting and finishing times) that have to be scheduled in a number of halls without conflicts. Design an algorithm to find the minimum number of halls needed for this purpose. Note that the timings are fixed and no two events can happen at the same time in the same hall. You can think of the events as intervals on the real line such that we have to assign a color to each interval in a way that no two overlapping intervals are assigned the same color. What is the minimum number of colors required?