Write regular expressions for the following languages.

The alphabet = 10,11

a) {w | w either begins or ends (or both) with 01}

b) {w | w begins with 10, ends with 01, and contains the substring 00}

c){w | every odd position of w is 1}

d) {w | w has an even number of 0s or exactly two 1s}

e){w | w does not end with 11}