Give regular expressions generating the following languages. The alphabet is {0, 1}.

(a) {w | w begins with a 0 and ends with a 1}

(b) {w | w contains at least four 0s}

(c) {w | w contains the substring 1101}

(d) {w | w has length at least 4 and its third symbol is a 0}

(e) {w | w begins with a 0 and has even length, or begins with a 1 and has odd length}

(f) {E, 0}

(g) The empty set

(h) All strings except the empty string