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

2. A simple form of recurrence relation is 7(1) = a T(n) T(n/2) + b for n>l where a and b are constants. Solve this recurrence. That is, express T(n) in terms of a and b only, not in terms of T itself. You may assume n is a power of 2, for convenience. Then, identify the correct formula for T(16), T(32), T(64), or T(128) in the list below. a) T(64) 64a+64b b) T(128) a 128b c) 16) = 16a + 4b d) T764) = a + 6b