Zookeeper uses ZAB, a variant of algorithm.

$1$ point

Paxos

Bully

Chubby

Ring based

In the LCR algorithm for leader election, the message complexity is$,$

$1$ point

$(n^2)$

$(nlogn)$

$(n^3)$

$O(n)$

The lower bound on message complexity for an leader election algorithm for asynchronous rings whose size is not known a priori is$,$

$1$ point

$(nlogn)$

$(n^2)$

$(n)$

$(2^n)$