Answer the following question using a step-by-step procedure. Include all necessary steps and comments, showing all your work throughout the solution. The material is based of zybooks and what was lectured during class time. Thank you and will rate afterwards!

2. (15 pts) Recall that any recurrence of the form T(n)=aT(n/b)+O"), where a, b and c are all positive values and b>1, has the following solution: T(n) = O(nlogba) if nlogh a > c. T(n) = 0(n) if nlogb a