5. For each part, show that the language is regular, or use the pumping lemma to show that the language i:s nonregular. You must justify your answers to receive full credit. 20 points a) L, -wow |wE 0,1 where s is the reverse of string s d) 4={ 01J0% 1 1 0 }