1. For each of the following languages show that the number of equivalence classes of the right congruence relation over A* is infinite (so the language cannot be regular): A-l num(a, 2)num(1.2) (b) the set of all such strings that if the string begins with an a, then each sequence of consecutive symbols a is followed by the same number of consecutive symbols b; if the Is b is followed by the same number of consecutive symbols a