Which of the following statements is/are correct? I. The language L accepts all the strings of a's and b’s where the third symbol from left end is b. The regular expression for L is (a + b)² b(a+b)*....

Extracted text: Which of the following statements is/are correct? I. The language L accepts all the strings of a's and b’s where the third symbol from left end is b. The regular expression for L is (a + b)² b(a+b)*. II. The language L accepts all the strings of a's and b's where the number of a's in a string is divisible by 3. The regular expression for L is (b* ab* ab*ab*)* . III. The regular expression R =(a+b)" . The number of states required to construct the minimal DFA for the regular expression R is n+2. (A) I and II (B) I and III (С) II and III (D) All are correct