2) (15 points) Give a regular expression that generates the set of all strings over (0,1) that contain either substring 11 or 00 (or both). For example, some strings generated by the regular expression should include 111010, 100010, and 111001100010. Some strings not generated by the regular expression should include 010, 01, 0 1010, 0101, 1010 and ? the 3) (15 points) State the definition of an NFA 4) (12 points) List the parts of an inductive proof, as described in class