For each of the following recurrences, give an expression for the runtime T(n) if the recurrence can be solved with the Master Theorem. Otherwise, explain why the Master Theorem does not apply. Justify your answer.

1. T (n) = 3T (n/2) + n 2
2. T (n) = 4T (n/2) + n 2
3. T (n) = T (n/2) + 2n
4. T (n) = 2nT (n/2) + nn
5. T (n) = 16T (n/4) + n
6. T (n) = 2T (n/2) + n log n
7. T (n) = 3T (n/3) + √ n
8. T (n) = 2T (n/4) + n 0.51
9. T (n) = 0.5T (n/2) + 1/n
10. T (n) = 3T (n/2) + n

homozygous. one is homozygous, while two is heterozygous.

steve should create a type of business report called a business plan. the correct option among the options that are already given in the question is the last or the fourth option. this business report created by steve will actually influence the investors about investing their money in steve's business. this business report will have all the details about the business, the amount of investment required and the amount of expected profit.