Part $3$:

This utilizes JFLAP as seen in Module $2$ and Try It Out in Module $3.$ Click on the Regular Pumping Lemma button:

Choose this option:

L$=\{($ab$)^(2$n$)$:n$=1,2,$dots$\}$

Start by selecting some m value which is the same as the N number of states from our lectures. Choose m$=6$ to represent a machine of $6$ states, which

will also limit the amount of letters in x and y$.$ This creates the string abababababab.

Question $8$:

Create an x and y such that it pumps. Take a screenshot and use that as part of your submission.

Question $9$:

What does it mean if it pumps?

Question $10$:

Use the Myhill$-$Nerode thereon to show this language is regular.