Describe the formal languages denoted by the following regular expressions using the English language:
A) Language of all strings over the alphabet
B) Language of all strings that contain 'a'
C) Language of all strings that start with 'a' followed by zero or more 'b's
D) Language of all strings that contain an equal number of 'a's and 'b's
