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

Click the arrows to advance or review slides. mapping carbohydrates to food carbohydrates (grams) 15 food (quantity) bread (1 slice) pasta (1/3 cup) apple (1 medium) mashed potatoes (1/2 cup) broccoli (1/2 cup) carrots (1/2 cup) milk (1 cup) yogurt (6 oz.) 12 12 is jennifer's relation a function? yes no f 1 of 2 → jennifer figure out the difference between a function and a relation by answering the questions about her food choices