Please do these Questions as soon as possible. i will give you a thumbs up if you will do a good job.

The alphabet { = {a,b} will be used for all of the following exercises. 1. Give regular expressions which exactly define the following languages. (a) L, which has exactly one b but any number of as. [7 marks] (b) L2 which has an even number of as and an even number of bs. [7 marks] (c) L3 which contains exactly two as or exactly two bs, although not necessarily adjacent. [7 marks] (d) L4 which has all the as appearing before any of the bs, or all the bs appearing before any of the as. [7 marks] (e) L5 where there can be any number of bs but the number of as must be even, although the as do not have to be adjacent. [7 marks] 2. Create finite state automota (FSA) for the languages L through to L5 defined above. For each FSA you create, pick one string that belongs to the language and show that it is accepted, and one string that does not belong to the language and show that it is rejected. You will receive up to 7 marks for each FSA, and up to 3 marks for each string you pick and show is either accepted or rejected. This gives a total of 65 marks for this