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!

i need more details

step-by-step explanation:

5.7622

step-by-step explanation:

the ten thousandths place is the 2. you round it up if, that number in whatever place is 5 or higher.

answers

\3. yes the presentation (i.e. odd numbers being written as differences of two squares) is possible for all odd natural number however the presentation may not be unique. for example,  57=112−82=292−28257=112−82=292−282.

\4. 2 can't be written as a difference of two squares because 4-1=3 and 1-1=0 and the difference of squares grows to integers larger that 3.

can i get some in proving questions 1 and 2?