A binary tree is full if all of its vertices have either zero or two children. Let Bn denote the number of full binary trees with n vertices.

(a) By drawing out all full binary trees with 3, 5, or 7 vertices, determine the exact values of B3, B5, and B7. Why have we left out even numbers of vertices, like B4?

(b) For general n, derive a recurrence relation for Bn.
(c) Show by induction that Bn is (2n). 2.14. You are given an array of n elements, and

Anshyper sonic (sega)

For question 1, i'm a bit stuck between serif fonts or large enough type to read. serif fonts are good fonts to use because their easy to read. but you also need your type be large enough to read. if i had to say what you need to consider most important, i would say d is the answer.  for question 3, i believe the answer is d. it seems most appropriate to do that. on every page or every other page would be too much, and only on the contact page just seems inappropriate.  for question 4, it's probably a. by "color scheme" it doesn't mean just one color, but a set of colors. colors that are complimentary to each other. having too many is too distracting so it's best to limit it as much as possible, but not to the point where your website looks dull.hope this !