We eliminate state 3 using the state-elimination algorithm (as discussed in the textbook) and the resulting state diagram is As your answer write what are the regular expressions X,Y,Z,V. Clearly write X= Y=, Z=, V= Let L be the language denoted by the regular expression (ba+bba)(+a+aa) Which of the following strings is in L ? aaba is in L baaba is in L aaa is in L abbaa is in L abb is in L None of the above strings is in L