Use the Master Theorem to give the tightest Big-O bound on the following recurrences: a. T(n) = 3T(n/3) + 6n
b. T(n) = 11T(n/2) + 203n^3
c. T(n) = 2T(n/4) + n^2

Solve the equation using the zero-product property. -3n(7n - 5) = 0 a. 0, -5/7 b. -1/3, -5/7 c. -1/3, 5/7 d. 0, 5/7

Dean and karlene get paid to write songs. dean is paid a one-time fee of $20 plus $80 per day. karlene is paid a one-time fee of $25 plus $100 per day. write an expression to represent how much a producer will pay to hire both to work the same number of days on a song.

You buy 4 items that cost 2.69 14.45 8.05 13.95 what is the estimated total round to the nearest dollar