uestion 1: Give regular expressions describing the following languages. In all cases, the alphabet is 10, 1). Justify your answers { w : w contains an even number of 0s and each 0 is followed by at least one 1 ) . w w contains exactly two Os and at least two 1s). {w : every odd position in w is 1}