Language Corresponding Regular Expression E 0 001 0+1 03 (001) ( i.e. {0} {0}{1} {0,1} (i.e. {0} U {1}) {0.10; (i.e. {0} U {10} {1,5}{001) {110}{0,1) {1}{10) (10,111,11010) (0.103"(11) U (001.8}) 0+ 10 (1+8)001 (110)*(0+1) 1910 (10 +111+11010) (0+10)*((11) + 001 + E) 1. Find regular expressions representing the following sets: a. The set of all strings over (0.1) having atmost one pair of O's or at most one pair of I's, b. The set of all strings over (ab) in which the number of occurrences of a is divisible by 3 c. The set of all strings over (a.b) in which there is at least two occurrences of b between any two occurrences of a d. The set of all strings over {a,b) with three consecutiveb's e. The set of all strings over {0,1) beginning with 00 f The set of all strings over {0,1}ending with 00 and beginning with 1 2. Construct a finite automata accepting all strings over (0.1) ending in 010 or 0010 3. Construct a FA corresponding to the regular expression aab + c)b ba .bb + baba