Select the time complexity of below algorithm:

send value of own id $($i$)$ to the left

when received an id $(j)($from the right$)$:

$2\mathrm{.}1$ if $j>$i then forward $j$ to the left $($this processor has lost$)$

$2\mathrm{.}2$ if $j=$i then select self $($this processor has won$)$

$2\mathrm{.}3$ if $O(n)$

$O(logn)$

$O(n^2)$

$O(1)Okk{2}^{k-1},4^k$

$2k,4**2^k$

$k,2^k$

$2^k,4**2^{k}j$ then $do$ nothing

$O(n)$

$O(logn)$

$O(n^2)$

$O(1)$

$In$ the $O(nlogn)$ messages leader election algorithm, the probe distance $in$ phase $kis$ and the Number $of$ messages initiated $by$ a processor $in$ phase $kisat$ most including probes and replies $in$ both directions.

$2^{k-1},4^k$

$2k,4**2^k$

$k,2^k$

$2^k,4**2^k$