Countability

Question 1
Given Σ = {a,b}, which one of the following sets is not countable?
A
Set of all strings over Σ
B
Set of all languages over Σ
C
Set of all regular languages over Σ
D
Set of all languages over Σ accepted by Turing machines
       Theory-of-Computation       Countability       Gate-1997
Question 1 Explanation: 
Uncountable: Set of all languages over Σ is uncountable.
There is 1 question to complete.