How many times is function $F$ called in the code segment? Choose the tightest

bound from the big$-$O notations below.

for $(i=n$;$i>0$;$i=i-2)$ do

for $(j=i$;$j>0$;$j=\frac{j}{2})$ do

$F(i,j)$;

end for

end for