Let b_n be the number of full, binary, rooted ordered trees with n leaves (and n - 1 internal nodes.) A full binary tree is a tree where every node is either a leaf, or it has exactly two children. Give a recursive definition for b_n. Show how the recursion is derived! (A full binary tree is a tree where each node has zero or two children.)