problem. Algorithm A has a wore the are tworithms A and B for solving the same relation where n is the input size. Algoritho TA(n)=8TA(n/2)+10n2.3, the recurrence relation TB(n)=7TB(n/2)+200n2.4 where n is the input size. (a) Use the Master method to solve for TA(n). On the answer sheet, decide which case of the Master method TA(n) falls into, by checking the corresponding box. (b) On the answer sheet, decide the asymptotic notation of TA(n) by checking the corresponding box. (c) Use the Master method to solve for TB(n). On the answer sheet, decide which case of the Master method TB(n) falls into, by checking the corresponding box. (d) On the answer sheet, decide the asymptotic notation of TB(n) by checking the corresponding box. (e) Algorithm C for solving the same problem has a worst-case time complexity TC(n) that satisfies the recurrence relation TC(n)=TC(n/4)+100n2.5 where n is the input size. What is the largest integer value of such that Algorithm C is asymptotically faster than both Algorithm A and Algorithm B? The following are some logarithms for your convenience: log28=3,log48=1.5,log27