1. Regular Expression Write regular expressions for the following languages. You may use either Python notation or the minimal "algebraic" notation, but make sure to say which one you are using. (a) ( 1 point) all strings that start at the beginning of the line with a word and that end at the end of the line with an integer (b) (1 point) the set of all strings with three consecutive repeated words (e.g. "Humbert Humbert Humbert" and "the the the" but not "the bug bug" or "the big bug") (2p) (c) (1 point) Translate the following regular expression to an equivalent nondeterministic FSA: /(kn)(uo)t(iten)?/ Les F be the following FSA: (d) (1 point) Give the smallest word of L(F) which pass by all the edges of F (e) (1 point) Write a regular expression for the language accepted by F (f) ( 2 points) Draw a Finite State Transducer such that it output - 'Wizard' 'Wizard' - 'Wizards' 'WizardPI' - 'Witch' 'Witch' - 'Witches' 'Witch\#Pl