Please provide detailed step-by-step solutions! Will give thumb-up for a good answer. Thank you!

4. Many divide-and-conquer algorithms have a running time that is expressed bv a recurrence such as: T(1) 1 T(n) aT(n/b)+n for n>l In terms of a and b, solve this equation to give a tight big-oh upper bound on T(n). Then, identify an instance of this solution below. Note, you should approximate log23 as 1.6 in the running times below a) If a-6 and b-4, then T(n) is O(n2) b) If a-2 and b-4, then T(n) is O(n2) c) If a 3 and b-4, then T(n) is O(n) d) If a-12 and b-3, then T(n) is O(n2)