Consider the election problem for anonymous trees of un known size, where communication is by asynchronous message passing.
(1) Give a randomized algorithm that is partially correct, process-term inates with probability one, and has an expected message complexity of O(N) messages. (Actually, an expected message complexity of N + 1 messages is achievable.)
(2) Does a deterministic algorithm exist for this case?
Text Book: Introduction to Distributed Algorithms By Gerard Tel.