Prove that in chordal ring Ctn electing a leader requires at least

n + n t log n t messages in the worst case (Hint: Reduce the problem to that of electing a leader on a ring of size n/t ).