. Consider the language: L(aa* + a*b) Construct the NFA that accepts the language. ii. List 2 strings in the language and show how they are in the language. Question #6: For the following regular expressions below, determine the minimum pumping lemma (the length of the string in the with the smallest length) a. 1*(0+1)0+ = b._a+(a*+b)(a+b)* C (1+0)0+ = d. (10) *0* = e. 1*(001)* =