Perform complexity analysis for the algorithm by

(1) find the recurrence equation;

(2) solve the recurrent equation and

(3) conclude on the complexity class for the algorithm by a proof.

Show how the recurrence equation is derived, how it is solved and prove the asymtotic complexity.

Analyze the total number of additions and subtractions in terms of n.

int Q(int n) { // n is a positive integer

if (n == 1) return 1;

else return Q(n-1) + 2*n 1;

}