Assume Σ {0,1}, write down the regular expression that generates each of the following language:
(1) {w/w contains a single 0 }
(2) {w/w contains at least two 0}
(3) {wlw ends with either 00 or 11 }
(4) {w/w starts and ends with different symbols }
(5) {w/w is a string of odd length}
(6) {w| every 1 in w is followed by at least one 0 }