index $=$ n $//2$

sum $=0$

while index $!=0$:

sum $=$ sum $+$ index

index $=$ index $//2$

print$($sum$)$

Select what is the Big$-$O running time for this algorithm.