$1.$ Given the following pseudocode: $($a$)(1\mathrm{.}50$ points$)$ Compute the complexity of this pseudocode as a function of $\backslash ($ T$($n$)\backslash ).$ Show all your work to get credit, including summations. $($b$)(0\mathrm{.}50$ points$)$ Compute the Big O time complexity $($worst case$)$ of this pseudocode. Show all your work to get credit$(2$ points$)$ Compute the big O time complexity $($worst case$)$ of the following code. Show all

your work to get credit, including a table of steps to $n($as seen in class$),$ and then

all the summations and all your work to compute the time complexity.

$x=0$;

for

print$("...")$

if

print$("...")$

for

print$("...")$

$\}$

$\}$

for $x^{++}(k=2$;$k$

print$("...")$

$\}$

print$("...")$

$x^{++}$;