[3 + 6 +3 =12] 1. a. Let L ={x,y} Suppose you have constructed the following language: "The set of all strings consisting of x or y which contains xyy somewhere in the string." i) Write the regular expression for this language ii) Convert the above regular expression into NFA. Show the string xyyxyy is supported by the above NFA or not. Mention the intermediary states