From our discussion, given a regular expression R, there exists a Deterministic Finite Automaton that recognizes the language described by the regular expression R. True TU False QUESTION 2 If a number of strings in a language A is finite. It is guaranteed that the language A is a regular language. O True False w starts with 00 and ends with 11}. Which choice is an example of a string in the language A of length at least p. Consider the language A = {w o a. 0011 Ob. 00(01)P11 (01)P od up 01P Suppose we are trying to prove that a language A is not regular. After picking a string s of length at least p, s can be divided into s = xyz satisfying all three conditions of the Pumping lemma. Because of this, A is a regular language. True False Consider a section of the following GNFA: Pa FA New transition arrows will be created as a result of removing state 1. What are they? O a. Transition from state 2 to state 2 with the label R5*Ry*. O b. Transition from state 2 to state 2 with the label R5R1. O C. Transition from state 2 to state 2 with the label R5 R1 and transition from state 2 to state 3 with the label R5R2. O d. Transition from state 2 to state 3 with the label R5R2