Question

PLEASE HELP! WILL MEDAL! Consider the following recurrence relation.
See screenshot please :)

Answer 1

were are you lost in this at?

Answer 2

all of it :(

Answer 3

the first line is just plugging in n=0 into that f(n) and showing the Q(0) = f(0) = 4

Answer 4

the next part is the induction step, assuming its true for some n=k

Q(k) = 2 Q(k+1) + 3, but for some reason they dont what a k+1 in there yet so they shift the index to k-1

Q(k-1) = 2 Q(k) + 3

Answer 5

pfft, -3 on the ends of those that is

Answer 6

@terenzreignz