Suppose you’re to organize a summer sports camp, and thefollowing problem comes up. the camp is supposed to have at least506one 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.