Question 1- Regular Expressions Find regular expressions that define the following languages: 1. All strings over the alphabet (a,bl that start and end with the substring abb. 2. All strings over the alphabet (a, b) that do not contain the substring aaa. . All strings over the alphabet (a, b] for which the number of "a" is a multiple of 3 (including zero). 4. All binary numbers greater than 10111. All strings of the kind EPX where E is an integer number, P is a lowercase letter and X is an integer greater than 3 and less than 13. Examples: 143a6, 555b12, etc