(a) Let L be a language comprising all strings w such that w contains an even number of 1s, an odd number of 0s, and no occurrences of the substring 10. Write down a regular expression that generates L. Justify your answer.

(b) In the C programming language, comments appear between delimiters such as / and /. Let L denote the language of all valid delimited comment strings. A member of L must begin with / and end with / but have no intervening /. For simplicity, assume that the characters within the comments that are not / or are only the symbols 0 and 1, so the alphabet is {0, 1, , /}. Give a regular expression that generates L.