Give regular expressions generating the following languages

i. fw | every odd position of w is 0) j. w w contain at least two Os and at most one 1) 1. fw l w contains an even number of 0s, or contains exactly two 1sy m. The empty set n. All strings except the empty string