Describe the Las Vegas type algorithm to find a leader among n-people and derive the recurrence relation for the number of rounds, (n) to elect the leader.

Plot (n) vs. n, for 2 n 10 and also plot p(n, j) for 0 j n, when n = 5 & n = 10.