Problem 3.2: [HWK: Due 14 Feb, 2018] Part (1): Using the construction in the preceding proposition, give the NFA that results from the regular expression ((10) (11 00) Part (2): If we try to replace the patter for RiM given by Hopcroft and Ullman with 15 the result does not always properly give the finite automaton corresponding to the starred versions of regular expressions. Show this by giving an example