Consider the following language Ly over the alphabet {0,1}: {"1" 2m >n>0} Show that this language is not regular. Consider the following Language over the alphabet {0,1}: { w w contains an equal number of occurrences of the substrings 01 and 10}: Thus 101 E A because 101 contains a single 01 and a single 10. Show that L2 is a regular language