a. Show that there exists an 0 (N log N) election algorithm for hypercubes without a sense of direction.
b. Show that there exists an O(N(log N +k)) election algorithm for networks with bounded degree k (i. e. , networks where each node has at most k neighbors) .
Text Book: Introduction to Distributed Algorithms By Gerard Tel.