Design Regular Expressions for the following languages.
i. Strings that contains at least two 1’s and exactly three 0’s. Ʃ={0, 1}
ii. Strings representing a word with length divisible by 4 and contains at least 1
vowel. Ʃ={a, b, c,…, z}
iii. Strings that contain ‘01’ as substrings at any place except at the beginning or at
the end. It accepts 1010, 0101,110110, etc. but does not accept 01, 0110, 1101,
00, etc. Ʃ={0, 1}
iv. Length of the strings cannot be less than 3 characters and the number of 1’s is
divisible by 2. It accepts, 101, 1001, 1111, etc. however rejects ϵ, 0, 1, 11, 100,
111, etc. Ʃ={0, 1}
v. Strings where no character appears consecutively more than 3 times? Ʃ={a,b,c}