I need help with the following question:

9. (10%) Consider the following NFA: 8 (a) Give all the computations of the automaton on the input strings bb, 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 in English. d) Describe the language of the automaton by means of a regular expression e) Describe the language of the automaton by means of a context-free grammar