Solve the C question..

lar Languages and Lan ve integers. 93 4.11 Exercises 27. (a -Ma z0-9) 28. (1-90-9X0-9)1-910-90-9)?1(-9x0-9)?10-90-9)? C. Simplify the following RegEx's: ber they represent is alo s and any number of bs y number of bs in onie anyon! 00"(0 + )(I+A)(1+)(1+2" 30. 31. (00+11 +01+10)* 32. abc + a(e + b)(c+ b)+(b+caic+ b)+ (c+bc+ b)a(bc(b+ cb+ c) D. or the following, construct a finite automaton (deterministic finite automaton or non- deterministic finite automaton) first and then convert it to a RegEx. 33. Strings over (a, b) with an odd number of a s and an odd number of bs. 34. Binary strings not containing the keyword 011. ree symbols and at leas a sequence of two or run of Os of lenth35. Binary strings in which every 0 is followed by 11. 36. Binary strings representing positive integers divisible by 3