algorithm please solve it with clear hand write

1. Substitution and Tree Methods. (14 points) Consider the following recurrencer T(n) =T(n - 1) + 2 (a) Assume that the base case is T(1) = e(1). Show that the solution to this recurrence is O(n) using: (a) (6 points) The substitution method (b) (6 points) The recursion tree method (b) (2 points) Is T(n) = N(n)? Explain your