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. S6M6(n/2) + 07/3 log(n) when n > 2273, (b) My(n) = 6734 otherwise. S9M.(n/3) + n log(n) when n > 8/3, (c) Mc(n) = otherwise. = = 86 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. S6M6(n/2) + 07/3 log(n) when n > 2273, (b) My(n) = 6734 otherwise. S9M.(n/3) + n log(n) when n > 8/3, (c) Mc(n) = otherwise. = = 86