3. Showing your work for relevant comparisons, for the following recurrence relations apply the master method to identify whether original problems or subproblems dominate, or whether they are compa- rable. Then write down a bound. S2Ma (n/3.14) + n log(n) when n > 0.001, (a) Ma(n) 1337 otherwise. (6M(n/2) +n7/3 log(n) when n > 2273, (b) M.(n) 6734 otherwise. S9Me(n/3) + n log(n) when n > 8/3, (c) M.(n) = otherwise. 86 Solution