14.6 Complete the details of the proof of Theorem 14.3. Try to prove a stronger result showing that there is no randomized leader election algorithm that knows n within a factor larger than 2. Formally, prove that there is no randomized leader election algorithm that works both for rings of size n and for rings of size 2n.