Write regular expressions and draw deterministic finite state machines for the following languages. The alphabet for all is {a,b,c}. Empty strings are legal unless stated otherwise. A string is accepted if the statement is true about it, regardless of what else is true about the string. 1a. String contains exactly one a. ( cabcc is ok, but not cabbac or bbcc ) 1b. String contains exactly two a's. ( aa and babbca are ok, but not aaaa ) 10. String contains an even number of a's (zero counts as even). ( abaabba is ok, but not abccaabb )