[Solved]Consider Following Problem Organizing Conference Let T T1 Tn List Times Participants Arri Q37210988

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. Add I to the solution set S. Then recursively continueon the points in T not covered by I.
If the algorithm is not correct, then provide an example set T onwhich it produces a wrong result.
(b) Does the following algorithm correctly solve the problem? Lettj be the smallest (leftmost) point in T. Add the interval I = (tj;
tj + 1) to the solution set S. (The interval I is one hour long. Itstarts at time tj and ends one hour later.) Then, recursivelycontinue
on the points in T not covered by I. If the algorithm is notcorrect, then provide an example set T on which it produces awrong
result.

Expert Answer

---

Answer to Consider the following problem. You are organizing a conference. Let T ={t1,…,tn} be a list of times when participants… . . .