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

option a, c,d are correct.

step-by-step explanation:

from the given figure, it is given that z is equidistant from the sides of the triangle rst, then from triangle tzb and triangle szb, we have

tz=sz(given)

bz=zb(common)

therefore, by rhs rule,δtzb ≅δszb

by cpctc, sz≅tz

also, from δctz and δasz,

tz=sz(given)

∠tcz=∠saz(90°)

by rhs rule, δctz ≅ δasz, therefore by cpctc, ∠ctz≅∠asz

also,from δasz and δzsb,

zs=sz(common)

∠zbs=∠saz=90°

by rhs rule, δasz ≅δzsb, therefore, by cpctc, ∠asz≅∠zsb

hence, option a, c,d are correct.

step-by-step explanation:

3024 rhe base is what up in worry about

it would take 5 hours i think idk i'm not that good at math.can you me with my questions i need asap.