Let L1, L2 C2* be two languages over the alphabet and defined as follows: L1 = {w | 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 and a, be the regular expressions representing L and L2, respectively. Design NFAs for i. 41:22 (5 pt) ii. aj + az (5 pt) iii. (a)* (5 pt) iv. (az)* (5 pt)