Find the time complexity $()$ and its big$-$O estimate of the following section of code. $[$A $10$pts$]$for $($i $=1$; i $<=$ n; i $*=2)\{$ for $($j $=1$; j $<=$ i; j $+=2)\{//7$ statements; $\}\}$Tips: we assume that n could be written as a power of $2.$