How many times is function F called in the code segment? Choose the tightest bound from the big$-$O notations below.

$-------------------------------------------$

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

$2$: for $($j $=$ i; j $>0$; j $=$ j$/2)$ do

$3$: F$($i$,$j$)$;

$4$: end for

$5$: end for

$------------------------------------------$