8. (1pts) In the previous homework, you have shown that the following language over = {a,b) A = {ww contains an equal number of occurrences of the substrings ab and ba} is regular. Show how the pumping lemma for regular languages applies on A: i.e., determine a pumping length p and a suitable partition s = Tyz for each strings e A whose length is at least p. Elint: you can use different partitions for different strings.] Solution: 9. (Apts) Consider the following language over = {1}: A= {w is a perfect square). Prove that A is nonregular. Solution