we can prove that set of all strings over any infinite alphabet(as said more than one symbol) is uncountable by proper ordering. we will see that even to generate a string of length k would not be any enumeration possible in finite steps. hence set of L ⊊ ∊* so L is uncountable.
now set of all languages = power set of of ∊* i.e 2 ^(∊*) and we can prove that if S is countable then power set of set of S is uncountable by diagonalization. so oviously if S is uncountable as here then power set of S is uncountable
But, i am not sure as just not getting enumeration method is not enough to conclude that it is uncountable as there may exist other.but i dont think using proper ordering we will get enumeration hence i concluded that it cant be enumerated.