A guest at computer science Halloween party is a celebrity if this person is known by any other guest, but knows none of them.A particular party may have no celebrity. Your task is $(1)$ to prove that there is at most one celebrity at the party. $(2)$ too funds the celebrity if one exist, at the party by asking only one type of question. Asking a guest whether they know a second guest. everyone must answer your question truthfully. that is if Alice and Bob are the two people at the party, you can ask Alice if she knows Bob, she must answer correctly. use mathematical induction to show that if there are n people at the Halloween party then $3($n$-1)$ question are enough to find out the currenccelebrity if there is one