Formal language

Directions Show At. (a) For any sets A and B, prove (b) Given the following word w-ut, and the alphabet ?-{a,b,c), with u-aaaaa and u-belote, show that lelJul+lel (e) Let the language L = {11,001,000). which of the following strings are in L. (circle all that apply): i. 01010101 ii. 0010011001 ii. 0000010001 iv. 000000000 v. 00111001 vi. 000111 vii. ? (d) Let the language L = {11,01,00). Which of the following strings are not in L. (circle all that apply): i. 0000000 ii. 01010101 ii. 0010011001 iv. 000011 v. 0011110001 vi. 0000011 vii. None of the above