(Solved) : 3 Suppose Charge Hiring University Narrowed Search N Potential Candidates C1 Cn Visiting Q37892280 . . .
Please show your work.
3. Suppose you are in charge of hiring at a university. You have narrowed down your search to n potential candidates C1,. , Cn who are visiting throughout the entire quarter. You are given fi and i, which are the first and last days that Ci will be visiting You wish to give a tour of the campus to each of the candidates. If you give a tour of the campus on a series of days such that each candidate gets to attend at least one tour. (i.e., if you plan a tour on day d then any candidate with fi S d < li is available for the tour for that day.) Any number of candidates can attend a single tour if they are available that day Your goal is to schedule the fewest number of tours For example, if Abe is visiting from day 1 to 3, Beth from day 2 to 7, Cora from day 1 to 5, and David from day 4 to 6, you can have one tour on day 3 with Abe, Beth and Cora and one on day 4 with just David Here are two greedy strategies for this problem. One always gives a minimum number of tours, the other does not. First, say which one is optimal, and which strategy is not. (3 points) Then, give an example where the non-optimal strategy fails to find the minimum. (3 points) Third, prove that the other strategy does always find the minimum (9 points). Finally, describe how to implement the optimal strategy efficiently and give a time analysis (5 points.) Candidate Greedy Strategy I: Plan a tour for the earliest last day of a candidate’s visit. Invite all candidates available that day for that tour. Then recursively schedule tours for the set of candidates who cannot attend that one Candidate Greedy Strategy II: Plan a tour on a day that has the maximum number of people visiting. Then invite all of those people available on that day. Recursively schedule tours for the set of candidates who cannot attend that one Show transcribed image text
Expert Answer
Answer to 3 Suppose Charge Hiring University Narrowed Search N Potential Candidates C1 Cn Visiting Q37892280 . . .
OR