$1.$ Find space and time complexity for the following algorithm: $(1$ point$)$

i$=1$;

k$=1$;

while$($k$0)\{$

i $+=$ y;

k$=$ y$/2$;

$\}$

return i;

$\}$

int fun$2($int n$)\{$

int x $=0$;

for $($int i$=0$; i