4. [20 points] Assume that there are n job candidates that arrive separately to a networking event. Assume that there are more than n highstand tables at the event, and that each arriving job candidate looks to see if any of his or her friends are present and, if so, the job candidate stands around the high-stand table that has a friend around it. Otherwise, the job candidate stands around an unoccupied high-stand table. Assume that each of the (3) pairs of job candidates is, independently, a pair of friends with probability p. Let Y denote the number of occupied high-stand tables. Show that 1012)\