Problem $26$: Suppose that a connected graph $G$ has only two distinct eigenvalues. Prove that

$G$ is the complete graph.

$[$ Hint $($to be read backwards$)$: $?$hparg eht fo retemaid eht tuoba yas uoy nac tahW $]$