For which of the following does there exist a tree satisfying the specified constraints?

• A. A rooted tree of height 3 where every vertex has at most 3 children and there are 41 total vertices.
• B. A full binary tree with 31 leaves, each leaf of height 5.
• C. A binary tree with 2 leaves and height 100.
• D. A full binary tree with 11 vertices and height 6.