Consider the following C code:

for$($i $=0$; i $<=$ n; i $+=2)$

for$($j $=$ i; j $<$ n; j$++)$

foo$($j$)$;

Assume that foo$($m$)$ is a function of $\_($m$)$ complexity.

How many times is foo$()$ invoked if n $=100?$

Circle the statements below which correctly describe the code's complexity.