T(1)=1, T(n)=T(n-1)+5. solve these recurrence relations by either the forward substitution or backward substitution method.

(1) show three expansions so that the emerging pattern is evident. (2) then write out T(n) fully and simplify. (3) demonstrate that your solution is correct by substituting it in the LHS and RHS of the recurrence relation and showing that LHS=RHS.

(4) finally state the complexity order of T(n)