For each of the following regular expression, give two strings that are members of the corresponding language, and two strings that are not. (a total of 4 strings for each part) Here = {0,1} (a) (2 02*1* 0 (b) (U 1)0* (c) U ( *)1* U (d) 0*10(11)*) U 1* (e) (OU10 U11) *