<h2>
Answer with explanation:</h2>
We are asked to prove by the method of mathematical induction that:

where n is a positive integer.
then we have:

Hence, the result is true for n=1.
- Let us assume that the result is true for n=k
i.e.

- Now, we have to prove the result for n=k+1
i.e.
<u>To prove:</u> 
Let us take n=k+1
Hence, we have:

( Since, the result was true for n=k )
Hence, we have:

Also, we know that:

(
Since, for n=k+1 being a positive integer we have:
)
Hence, we have finally,

Hence, the result holds true for n=k+1
Hence, we may infer that the result is true for all n belonging to positive integer.
i.e.
where n is a positive integer.
Grayson's mistake was that he multiplied 4 and 3 and then used the exponent he had to square 3 and then multiply it by 4.
Emily's mistake was that she added 2 to 36 instead of multiplying it by -2
Pat's mistake was that he forget to make y into -2 instead of 2
The right way to do this is 4(3^2)+2(-2)
(3^2)=9 9×4=36 2(-2)=-4 -4+9=5
Answer:
the answer is b i thinkk.