Eigenvalues · Superchallenge problem

The path graph on $5$ vertices has vertices $1, 2, 3, 4, 5$ and edges $\{1,2\}, \{2,3\}, \{3,4\}, \{4,5\}$. Find the largest eigenvalue of its adjacency matrix.