Consider the following Language over the alphabet f0,1g: fw j w contains an equal number of occurrences of the substrings 01 and 10g. Thus 101 2 A because 101 contains a single 01 and a single 10. Show that L2 is a regular language.