Question II $(15$ points$)$: Consider the following algorithm, where the input is an even integer $n.$

for$(i=0$;$in$;$i+=2$

for$(j=i+1$;$jn**n$;$j++$

$x=x+2$; $//$Statement $1$

$\}$

$\}$

$(13$ points$)$ Determine the number of times Statement $1$ gets executed, showing all the steps.

$(2$ points$)$ Write the cost of the algorithm using Big $()$ notation.