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