1. Young Jeanie knows she has two parents, four grandparents, eight great grandparents, and so on. (a) Write a recursive function to compute the number of Jeanies ancestors in the n th previous generation without using the expt function. The number of ancestors in each generation back produces a sequence that may look familiar:

2, 4, 8, 16, . . .

For each generation back, there are twice the number of ancestors than in the previous generation back. That is, an = 2an1. Of course, Jeanie knows she has two ancestors, her parents, one generation back.

(This needs to be done in Scheme)