The clockwise leader election algorithm in a ring of n nodes satisfies:

Question $12$ options:

message complexity

worst case running time O$($n $\backslash$log n$)$

message complexity O$($n$),$ running time O$($n$)$

message complexity

running time O$($n$)$

message complexity

running time O$($n$)$

message complexity

worst case running time