Exercise 2 (10 pts). There are N applicants for an open job. Assume that the applicants can be ranked from best to worst. The interviewer sees the / applicants sequentially, one after the other, in a random order. She must accept or reject each applicant on the spot without a chance to go back and reverse her decisions. She uses the following strategy (call it the k-strategy): she lets & applicants walk away and after that she chooses the first one who is better than all the previous applicants. If there is no such applicant then she has to hire the last applicant. She chooses the parameter & ahead of time. (a) What is the probability that with the k-strategy she hires the best applicant? Hint: Assume that the best candidate is the ith one. Then for the strategy to succeed, we clearly need k