If X is a non-empty finite language over a non-empty alphabet σ, and X² is a subset of X³, then in terms of set theory, which of the following statements is true?
a) X is a subset of X²
b) X intersect X² is empty
c) The empty string λ is in X
d) X³ is a subset of X