9 (12%) Consider the following NFA: (a) Give all the computations of the automaton on the input strings bb, aa, ab, aba, and e and determine if the strings are accepted. (b) Transform the automaton, using the subset construction, into an equivalent determin- istic finite automaton and remove the unreachable states. Show your working (c) Describe the language of the automaton by means of a regular expression. (d) Describe the language of the automaton by means of a context-free grammar