Consider the following recursive algorithm Algorithm Q ) / Imput: a positive integer n if n 1 return 1 else return O(n-1)+2*n-1 1) Set ap a reourrence relation for this function's value and solve it...

Extracted text: Consider the following recursive algorithm Algorithm Q ) / Imput: a positive integer n if n 1 return 1 else return O(n-1)+2*n-1 1) Set ap a reourrence relation for this function's value and solve it to determine what this algorithm computes. 2) Setup a recurence relation for the number of multiplication made by this algorithm and solve it to find the total nunber of multiplications that are executed