Generate an appropriate regular expression for each situation, withou the +or? operators. a. All binary strings that have an odd number of 1's. Example: 1,111,10101,0001 b. All binary strings that contain the substring 011. All strings over the alphabet fa,b,c) containing at least one a and one b. Example: ab,abc,aaccbb,cacbcabo c. d. All binary strings with at most one pair of consecutive 1's. Example: E,0,11,0110,10101010101,01101010 All binary strings that have an even number of 1's and 0's. Example: E,11,00,1100,0011,10101010 e. f. A NFA that accepts all binary strings with even parity. Example: , 0,00,11,100!,1010101