Consider the following recursive algorithm: ALGORITHM Q (n) //Input a positive integer n if n=1 return 1 else return Q(n1)+3n+1 a) Set up a recurrence relation for this function's values and solve it to determine what this algorithm computes. b) Set up a recurrence relation for the number of multiplications made by this algorithm and solve it