In: Advanced Math
T is a tree graph on 10 vertices, each is labled with an integer from 1-10. There are four leaves: 1, 2, 3, and 4.
1. What is the number of possible trees, such that the vertices labeled 1, 2, 3, and 4 are leaves, and the other labeled vertices can be either a leaf or not.
1. What is the number of possible trees, such that only 1, 2, 3, and 4 are leaves.