Are CSL, RE, Recursive languages closed under Subset operation?

Question

Regular languages are not closed under Subset - Example aⁿbⁿ  is subset of a^*b^* which is non-regular.

DCFL/CFL languages are not closed under Subset - Example aⁿbⁿcⁿ is subset of aⁿbⁿc^* which is non-cfl.

Are the languages CSL,Recursive or Recursively Enumerable lanuages closed under Subset operation? 

Comments

@Bikram Sir or @Arjun Sir Could you pls help in this?

---

Doesn't the example given you by prove the case for CSL, REC and R.E. languages also?

---

No language is closed under subset operation.