Consider the following algorithm.

Input : s$,$n $($s is a sequence of n numbers: s $=($s$1,$s$2,...,$sn$))$

Output: k $($integer$)$

Alice$($s$,$n$)\{$

k $=0$

i $=$ n

while $($i $>=1)$

for j $=1$ to i

k $=$ k $+$sj

i $=$i$/2$

return k