Hello, I need help with this computer science question.

1. For the following NFA, use the subset construction to produce an equivalent DFA. 1 40 B 0.1 2. Consider the RE (0+01*)*. (a) By following the spirit of the class algorithm, produce an equivalent NFA. (b) Describe in English the language of this RE