Q$5.($a$)$ What does this algorithm compute?$($b$)$ What is its basic operation?$($c$)$ How many times is the basic operation executed?$($d$)$ What is the efficiency class of this algorithm?$(2$ Marks$)$

Q$6.$ Solve the following recurrence relations using backward substution method.

$(2$ Marks$)$

$($a$)x(n)=x(n-1)+n-1$ for $n>0,x(0)=0$

$($b$)x(n)=x(\frac{n}{3})+n$ for $n>1,x(1)=1$