HQ15 Let L1 ... Lk be languages over alphabet S such that the languages are pairwise disjoint and contain among themselves every string in S*. Prove that if all Li are recursively enumerable then each Li is decidable. k is some known fixed constant.