Due Tuesday June 29

3.4: 43, 44 (note: you'll need to look
up definition of "full binary tree" in
the section).

Read section 3.5
3.5: 3,4,5,34,35

Section 6.2:  Read the section while recalling
how we discussed the "wouldn't it be nice if"
closed form for the Fibonacci numbers in class.
Then recall the "Mikebonacci" numbers from
the first test:

          | 0, if n=0
M_n =     | 1, if n=1
          | M_(n-2) + M_(n-1) + n-1, if n>1

Using the techniques of Section 6.2, find a closed
form for the Mikebonacci numbers.  Or if you find
this too difficult, at least find an approximate
form for M_n when n is large.

Also do problem 11.