find the recurrence relation for the given pseudo code and calculate its time complexity using substitution method.

verify the time complexity obtained with the substitution method using the recursion tree method.

ALGORITHM Q(n) //input: A positive integer n if n = 1 then return 1 else return Q(n-1)+2*n-1