1. Write regular expression for the following languages, alphabet {0,1} a. The set of strings that do not end with 11 b. The set of strings that do not contain substring 01 c. The set of strings...

Extracted text: 1. Write regular expression for the following languages, alphabet {0,1} a. The set of strings that do not end with 11 b. The set of strings that do not contain substring 01 c. The set of strings having 0 at every 3rd position. d. Describe the language given by the regular expression 0*10*10*1(1|0)* e. Set of all strings that are at least of length 4 and contains an even number of 1’s.