I want to show that if $M$ is maximal subgroup of a finite group $G$, if $M$ is normal in $G$, then $|G:M|$ is prime. I feel pretty close to getting this one, but I'm getting stuck
Suppose $M \leq G$ is maximal in the finite group $G$. Suppose also $M \lhd G$ but toward a contradiction, suppose $M$ does not have prime index in $G$. Then $|G:M| = pm$ for $p$ prime and $m \in \mathbb{N}, m \geq 2$. Now, $G/M$ is a group with $|G/M| = pm$. By Cauchy's theorem, there exists $A \leq G/M$ with $|A| = p$. By lattice correspondence theorem, $A \cong \frac{B}{M}$ for some $B \in \{X: M \leq X \leq G\}$. Then, we can write
$$|G:M| = |G:B||B:M| \implies |G:B| = \frac{|G:M|}{|B:M|}$$
If I can show that $|B:M| \geq 2$, then I will have a contradiction since the index of $B$ will be strictly less than $|G:M|$, implying $M < B$; at the same time, if I knew that $|B:M| \geq 2$, I would already have contradicted the maximality of $M$, completing the proof. Any ideas here? Is there a better approach to this problem? Any hints are greatly appreciated.