Given the following algorithm

foo$($n$)$

if n $<=1$

return $1$

else

x $=$ foo$($n$-1)$

for i $=1$ to n

x $=$ x $+$ i

return x

Determine the asymptotic running time. Assume that addition can be done in constant time.