Given a tree T with n nodes, how many subtrees (T') of T have at most k edges connected to (T - T')?
a) (2ᵏ⁻¹)
b) (2ⁿ⁻ᵏ)
c) (2ⁿ⁻¹)
d) (2ⁿ⁻ᵏ⁻¹)