Hello, please help me with question 2 in the following automata question, thank you for your help in advance

1. (105 extra pts) Write regular expressions for any two of the following three languages, assuming that the alphabet is (0, 1. You will receive up to 5 extra points if you provide regular expressions for all the three languages. (a) w wcontains a 1 in between two Os) (b) w w does not contain the substring 01) (c) wl wcontains an even number of Is and exactly one 0) 2. (15 pts) Use the algorithm you learned in class to convert the following NFA to an 3 P2