need help with Q36

Let M be the NFA-A 0 9- a) Compute -closure(.) for i = 0, 1, 2. b) Give the input transition function r for M. e) Use Algorithm 5.6.3 to construct a state diagram of a DFA that is equivalent to M. d) Give a regular expression for L(M)