PLEASE HELP ME WITH THIS PROBLEM AS QUICK AS YOU CAN. That would really help me out greatly. THANK YOU! Design a DFA to recognize the following languages over the set of symbols {0, 1} : a. A1 = {wl w contains at least one 1 and one 0} Sample strings in the language A1: 010101, 01, 10, 110, 0001, 00010000, 11101111111, 00100111 Sample strings NOT in the language A1: 000000, 111111, 0, 1,00, 11 b. A2 = {wl w contains an even number of Os} Sample strings in the language A2: 00, 1, 111, 0101010, 001, 1100, 00001, 0001000, 111011101111 Sample strings NOT in the language A2: 0000000, 1111101, 0, 000, 101 C. A3 = {wl w contains one or more Os followed by one or more 1s} Sample strings in the language A3: 01, 00011, 00000001, 001, 01111111, 0011111111111111 Sample strings NOT in the language A3: 000000, 111111,0, 1, 00, 11, 00000111110, 101010, 010100001