2. For each of the following languages give the regular expression that matches the strings in (a) 5 marks] The language, over the alphabet of binary digits, of strings that do not start (b) 5 marks The language, over the alphabet of decimal digits, of strings that represent (c) [5 marks] The language, over the alphabet of english letters, of strings that do not the language. Note: You can use. to denote "any" character in the alphabet. and end with the same digit. integers not divisible by 100. have two adjacent vowels (y is considered a vowel). not contain the substring 101