Let {, , , . . . , } be an alphabet. Construct regular expressions for the following languages i. The set of words which are zero or more repetitions of the letter . ii. The set of words in part (i), followed by one or more repetitions of words or . iii. The set of words in part (ii), followed by one repetition of followed by zero or more repetitions of .

Give three NFA which accept the set of words described by the three regular expressions in your answer to Question 1a (i), (ii) and (iii).