Giving the following recurrence ()={ 2 (2)+ Show that the that the asymptotic upper bound of T(n) is O(2). (Hints: you need to consider two cases: n is even number, and n is odd number)