1. Regular Expressions

(a)Construct an -NFA that represents the language defined by the following regular expression: R = 10 (01)+ + 0(00 + 11) Note the + notation means "or", e.g., (00 + 11) is a string consisting either of 00 or 11.

(b) Construct an -NFA that represents the language defined by the following regular expression: R = 1 00 + (00 + 1) Note the + notation means "or" notation (0 + 1) means 0 "or" 1.

(c) On the alphabet = {0, 1}, if we assume that 0 and 1 are binary digits and the strings in our language represent numeric values, describe, in English, the language that the following regular expression represents: R = (1 + 0) 00+ + (100 + 1100)