Use the pumping lemma to show that the following language is non-regular: {a^n b^2n , where n>1}

(a) Find a word in the language as an example to be used with the pumping lemma; (b) How many possible ways to choose the substring y from the example word for the pumping lemma? (c) Use the pumping lemma, show the given language is non-regular. (d) If any language (may not be the one specified in this problem) satisfies the pumping lemma, is this language a regular language? Yes or No?