I tried to find the closed formula, but I do not know what I should do after that. About #7, I have no idea what to write about "Every day the snail can choose to either climb up 1 foot or 2 feet." Could you help me?

6(a)

a1 = a0 /2 +1 = 4 / 2+1 = 3

a2 = a1 /2 +1 = 3 / 2+1 = 2.5

a3 = a2 /2 +1 = 2.5 / 2+1 = 2.25

Thanks,

g. (lOpts) Consider the recurrence relation an : an_1/2 | 1, a0 : 4. (a) Find a closed formula for the following recurrence relations. Show your steps. (b) Find a closed formula for the summation 27:0 an. Show your steps. 7. (10pts) A snail is at the bottom of a well on day 0. Every day the snail can choose to either climb up 1 foot or 2 feet. (a) Find a recurrence relation for the number of ways to climb n feet. Explain your answers. (b) Find the initial conditions. Explain your answers. (c) In how many ways can the snail climb out of a 6 feet well