For each part, show that the language is regular, or use the pumping lemma to show that the language is nonregular. You must justify your answers to receive full credit. 20 points a) L5 = 1w0w,e | we { 0,1}) where s"is the reverse of strings al c) L-020 1