Dentify asymptotic tight-bounds for T(n) in each of the following recurrences. Assume that T(n) is constant for n <= 2. You may use Master theorem, if useful or applicable, but justify your answers showing all relevant details. a.T(n) = 2T(n/2) + n3 b. T (n) = T (9n/10) + nc. T (n) = 16T (n/4) + n2d. T (n) = 7T (n/3) + n2e. T (n) = 7T(n/2) + n2f. T (n) = 2T (n/4) +vn. (vn is the square root of n!)g. T(n) = T(n - 1) + n. h.T(n) = T(vn) + 1. (That is square root of n!

1. if we have 3 babies what is the probability they’re going to be all boys? 2. if we roll 2 die at the same time what is the probability of getting less than 10 on the first roll and a 5 on the second roll 3. if we have 3 babies what is the probability their is going to be 2 girls? 4. if we have 3 babies what is the probability of having no more than 1 girl? 5. it we have 3 babies and then have another 3 babies what is the probability of us having at least 1 boy and then having all girls?

Elena is paid a constant rate for each hour she works. the table shows the amounts of money that elena earned for various amounts of time that she worked.

You buy five cds at a sale for $5.95 each. write an expression for the total cost of the cds.then use the distributive property and mental math to evaluate the expression.