Please provide step by step solution.

Exercise 2 (Recurrence Relations) Solve the following recurrence relations to determine T(n) (in big-O notation) (i) T(n) = 3T(n/2) + 0(1) (ii) T(n) = 4T(n/6) + 0(n) (iii) T(n) = 4T(n/8) + 0(n2) (iv) T(n) -T(n-1)+n (Note, this does not fit the form of the Master Theorem. However, shoalt be atl to fation unti you get T(n) as a function of T(0) 0)