Suppose you're helping to organize a summer sports camp, and thefollowing problem comes up. The camp is supposed to have at leastone counselor who's skilled at each of the n sports covered by the camp(baseball, volleyball, and so on). They have received job applications fromm potential counselors. For each of the n sports, there is some subsetof the m applicants qualified in that sport. The question is: For a givennumber k < m, is it possible to hire at most k of the counselors and haveat least one counselor qualified in each of the n sports? We'll call this theEfficient Recruiting Problem.Show that Efficient Recruiting is NP-complete.