Problem 2. [15 points) a. Convert the regular expression (01 0)*0 to an NFA. b. Describe in English the language denoted by the regular expression (01 0)*0. Give a brief explanation. c. Show that the regular expression 0(100)* denotes the same language as the expression in part b. Conclude that the equation (RS UR)*R=R(SR UR)* holds for all languages R, S