Use the construction in Theorem 3.1 pasted below and find an NFA recognizing the languages

A) (01 + 001 + 010)*

B) (0 + 1)*010

C) 0(10)*1

Linz Definition 3.1 (Regular Expression): Let be a given alphabet . Then: 1. ), 1, and a are all regular expressions. These are called primitive regular expressions. 2. If r and r2 are regular expressions, then r +12, 1119, 11, and (11) are also regular expressions. 3. A string is a regular expression if and only if it can be derived from the primitive regular expressions by a finite number of applications of the rules in (2)