= 1. Construct a DFA for the language L {w = {a,b}* | number of a's in a continuous sequence of a's in w is even and number of b's in a continuous sequence of b's in w is even}. 2. Construct a DFA for the language L = contain aabb}. {w {a,b}* | w contains ab but does not 3. Construct an NFA without E-moves for the language L = {w = {a,b}* | w starts with ab or contains aa or ends with ab}. 4. Given a DFA M for a language L, describe how to construct a DFA MT for the reverse language L so that ww2... Wk L" whenever wk... W2W1 L. 5. Give a regular expression for the language L contains aabb and ends with bb}. = {w {a,b}* | w starts with aa and