Solve the D question..

.-99)1-90-9x0-9)1-9x0-9)210-9%0-9y (a also c simplify the following RegEx's: s are pres order 31. (00 +11+ 01 +10)* 32. abc + alc+ bc+ b)+(calc + b)+(c+bXc+ba+(btoXb+cXb+c) or the following, construct a finite automaton (deterministic finite automaton or non- ast onedeterministic 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 b s. more 34. Binary strings not containing the keyword ol1. 35. Binary strings in which every 0 is followed by 11. 36. Binary strings representing positive integers divisible by 3. 3 fol umber E. Convert the given RegEx to an equivalent NFA: 080 digit 91 80 38. (0+11+10(1+00)*01)* 39, ((a + b + c)c)*(a + b + c+A)