Consider the following problem. You are organizing a conference.Let T ={t1,…,tn} be a list of times when participants arriveat
the airport. When a participant arrives at the airport there mustbe a student volunteer at the airport to meet the participantand
direct him/her to a shuttle. Each student volunteer should spend nomore than 1 hour at the airport. You need to come up with a
schedule that uses the smallest number of student volunteers andhas all the times in T covered.
(a) Does the following algorithm correctly solve the problem? Let Ibe a one hour time interval that covers the most number of
points in T.
OR
OR