Answer QUESTION 3 ONLY !!

= 2. For each of these formal languages, list five strings that are elements as well as five that not elements of the language. a. L1 = {a e {a,b}*| a = a"ba", for ne N} b. L2 = { e {a,b}*| B = a"ban+2, for n e N} C. L3 = {0 {a,b}"| o has fewer than three a's } d. L4 = {0 {0.1}* | every 1 in o has a 0 just before it and just after it } e. L5 = {0 {0.1,...,9}* | o represents an even number in decimal (tens) } = 3. Design the deterministic Finite State Machine for all languages in number 2