Consider the following recursive algorithm:

ALGORITHM $Q(n)//$ Input: A positive integer $n$

if $n=1$

return $1$

else

return $Q(n-1)+2n-1$

a$)$ What does this algorithm compute, i$.$e$.,$ what is $Q(n)?$

Set up a recurrence relation for this function's returned value and then solve it

b$)$ Compute the running time of this algorithm.

Set up a recurrence relation for the number of basic operations $($for example, multiplications$)$ made by this algorithm and then solve it

Hint: "Solving a Recurrence relation" means: find an explicit $($non$-$recursive$)$ formula that satisfies the relation and the initial condition.