Name: 1. Give NFAs with the specified number of states recognizing each of the following languages. In all cases, the alphabet is I = (0,1). (a) The language { w * w ends with 00 ) with three states (b) The language { w E. w contains the substring 0101, i.e., w = x0101y for some x, y 3* } with five states