A binary tree is full if all vertices have either 0 or two children. Let B_n denote the number of full binary trees with n vertices. What are the values of B_3, B_5, and B_7? For general n, derive a recurrence relation for B_n. Include base cases. Show that B_n is ohm(2^(n - 1)/2)