Consider the recurrenceT(n).T(n)={cifn≤4T(⌊pn⌋)+ difn>4a)Use the recursion tree or repeated substitution method to come up with a good guess for a boundf(n) on the recurrenceT(n).b) State and prove by induction two theorems showing(n)∈Θ(f(n))

she played for 18.75 hours.

step-by-step explanation:

if she played 2/4 of a hour on tuesday. and there is 60 minutes in an hour and 60 divided by 4 is 7.5. and she played 2/4 of an hour on thursday then again 60 divided by 4 is 7.5, you add 7.5+7.5=56.25. now you have to do 1/4 of an hour, it equals 3.75. now you have to add them all up. 3.75+7.5+7.5=18.75

i hope this and i hope you get it right. it took me a while to get this done for you. : )

answer:

3 bags of apples and 2 bags of oranges.

step-by-step explanation:

step-by-step explanation:

when the line is solid:

when the line is dashed:

this > inequality sign means:

this < inequality sign means:

this > inequality sign means:

this < inequality sign means:

about the problem:

srry i'm not done ! i'll

f(x)=2/3x-8, which give g(x) the greatest value.

step-by-step explanation: