Induction series #itssoeasy

Prove that for every $n \in N$ , $2^{3n} < 3^{2n}$

When $n = 1$ , $2^{3(1)} < 3^{2(1)}$ $\cdots (1)$

Statement holds true when $n=1$ .

Assuming statement holds true for integer $n$ :

$2^{3n} < 3^{2n}$ $\cdots (2)$

$8^{n} < 9^{n}$ $\cdots (3)$

Because $8<9$ $\cdots (4)$

Statement holds true for all $n \in N$ .

Even if I had proved the statement right, but by (complete) induction, which step am I missing? If my missing step is between (1) and (2), input as 12.

Bonus: Explain why.