1. Consider the alphabet - (0,1). Give regular expressions generating the following lan- guages (a) (v * I w has odd length and its middle symbol is l} (b) {w E * | w begins with a 0 and ends with a 1} (c) {w * I w contains at least four 0 (d) {w E * I w contains the substring 1101) (e) {w * I w has length at least 4 and its third symbol is a 0} (f) {w * w begins with a 0 and has even length, or begins with a l and has odd length} (h) The empty set (i) All strings over (j) All strings over except the empty string