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))

When the solutions to each of the two equations below are graphed in the xy-coordinate plane, the graphs of the solutions intersect at two places. write the y-cordninates of the points of intersection in the boxes below in order from smallest to largest. y=2x y=x^2-3

Petes dog weighed 30 pounds it then lost 16% of it's weight how much did pete lose

How to do a maths question? i have a mock