For a proof by induction of the math statement below, identify the correct step for proving the theorem is true for n = k + 1. HELP ASAP THANKS!!

What we do is simply replace every n with k+1. So (3n)^2 turns into (3(k+1))^2

We see that only choice A has the correct term mentioned on the left hand side, so this must be the answer.

The right hand side is treated the same way. We plug in n = k+1. Your teacher did a bit of algebraic manipulation to get what is shown for choice A.

for this pair of functions g(x)=x-2 and f(x)=|x| is (g o f)(a)= |a| -2

step-by-step explanation:

g(x)=x-2

f(x)=|x|

(g o f)(a)=?

(g o f)(x)=g(f(x))

(g o f)(x)=g(|x|)

(g o f)(x)=|x|-2

(g o f)(a)=|a|-2