theory of computation course

1. Write regular expression for each of the following languages over {0,1}. a. If w ( *) contains the substring 01 then w contains the substring 10 also. b. Each string w ( *) such that every odd position of w is a 1, e.g. 1, 101, 11101, etc. c. Each string w ( *) with alternating symbols, like 0101, 1010101. d. Each string w ( *) such that w contains at least two 0s and at most one 1.