Please look $at$ image, I $do$ not know how $to$ make this new text prompt work. For the following pseudo$-$codes, what is the time complexity function

$(T(n))$ and the order $()?$ You can ignore the overhead operations and just count the basic operations.

$($a$)$

$i=1$;

while $(i2n)$

$\{$ j$=1$;

while $(ji$;

$j++$ ;

$)$

cout$$;

j$++$ ;

$\}$

$\}$