Express the following languages with regular expressions. In all cases the input alphabet is -(0, 1} (a) A, 1,01) (b) fu begins with a 1 and ends with a 0) (c) w w contains at least three 1s) (d) fwevery character at an odd position of w is a 1 (e) w w contains an even number of Os, or exactly two 1s) Solution