Consider the following NFA: b. a start 1 2 3 a b (a) Give all the computations of the automaton on the input strings, ab, aab, abb, and abab, and determine whether these strings are accepted. (c) Transform the automaton, using the subset construction, into an equivalent determin- istic finite automaton and remove the unreachable states. Show your working. (d) Describe the language of the automaton in English.