My answer is in Bold, can you please tell me if I did this right.

Consider the following recursive algorithm. Algorithm Q(n) // Input: A positive integer n if n = 1 return 1 else return (n - 1) + 2 * n - 1 (a) Present the return value for Q(1) (b) Present the return value for Q(2) 2. 1 (c) Present the return value for Q(3) 3. 1 (d) Determine what the algorithm computes for a general number n. The algorithm will always return 1 because of its recursive nature