For the language L defined below, draw the transition diagram of an NFA or e-NFA that accepts the language. Provide a brief explanation of your construction in English, detailing what states represent, how strings are accepted, how c-transitions are used (if any), and how nondeterminism is used. Your explanation should give the ideas and intuition behind the construction, not a detailed listing of the transitions (which would only be a repetition of what is represented in the diagram) For the string given, not in the language, show all possible sequences of states to confirm that the string is not accepted. L = {w E {a, b)' I w = xy, where x has an odd number of a's and y contains either baa or abb as a substring) Example string not in L: aaba