Consider this diagram: 1,2 90 3 3 q1 2 93 From the following, select all the correct statements. 1,2,3 a. The language recognized by this DFA is not regular. O b. This DFA describes the following language: "All strings over the alphabet {1,2,3} that contain the string 321 as a substring." O c. The empty string is accepted by this language. Od. The language recognized by this DFA is infinite. e. The string 123 is not accepted by this language. O f. The language generated by this DFA is finite. g. This DFA describes the following language: "All strings over the alphabet {1,2,3} that contain the string 231 as a substring." h. In any string that belongs to that language, the string 231 can be anywhere, in the beginning, middle, or end, and it may repeat as many times as it is desirable.