Q1-Regular Expressions and Languages Let A be the language of strings over the alphabet Then r is: a, b] that have the substring ab in them. Letr ba b(a b)*. O A correct for A, meaning L(r) A. B comprehensive for A, meaning L(r)2 A, but not correct. O Csound for A, meaning L(r) C A, but not correct O Dneither sound nor comprehensive for A E correct for the complement of A, meaning A-.. Unanswered 2 attempts left Q2 - Regular Expressions and Languages Which one of these regular expressions is correct for the complement of the language denoted by the regular expression r b+ab'a) O CTca Consider the following three-state NFA N and the five GNFAs below it labeled a-e. Two states of N are labeled "t" because we're not saying which one to eliminate. Find the equivalent GNFA ab t d ab s c t c ab O A The one with start state s a O BThe one with start state s_b O CThe one with start state s.c O D The one with start state s.d O EThe one with start state s e Which one of these regular expressions represents the complement~L(N) of the language of the NFA N from Q3 O A (ab+ab bb) (ab) O B (ab+ab bb)(eab) o, because all states of V are essentially accepting states so L (N)- * c Suppose L is a regular language over = {a, b} that includes the following statements must be true? Click all that apply. and includes z-y wheneverz and y are both in L. Which of Multiple answers: You can select more than one option O A L must be infinite. O B There is a regular expression r such that r" denotes O D L-L=L. OEvery doubled word az where ar belongs to