Consider the following statement for the real numbers x$,$ y$.$ z: Vx Vy Use the pumping lemma to prove that the following $\{a^n{b}^k$:$nk\}$ language is or is not a

regular language. $($Needs to show all the solution steps to justify your answer to get the full points$).$z$($xyz $=$x$+$y$+$ z$)$

$1-$ Translate the above statement involving nested quantifiers into English.

$1-$ Determine the truth value of the statement.

$2-$ Formulate the negation of statement first symbolically, then translate it into proper English.