*PLease help convert REs to NFAs both 1 and 2. Thank you!!

1. Use the algorithm auto translate REs to NFAs to convert the following regular expressions to nondeterministic finite automata: (a) (01)* (b) 0*11(0 1)*

(2) Your solution for problem 2.1.b will have many more states than is required to encode the languages. Create a NFA that recognizes the same language using only 3 states (4 states if you use an explicit dead state).