3. Let L1, L2 CX* be two languages over the alphabet X and defined as follows: L = {w l w begins with a 1 and ends with a 0} L2 = {w w contains with at least three 1s} (a) Give regular expressions that represent L, and L2. (5 pt) (b) Let a, and a, be the regular expressions representing L, and L2, respectively. Design NFAs for i. az.az (5 pt) ii. aj + a2 (5 pt) iii. (a)* (5 pt) iv. (a)* (5 pt)