Which of the following describes a path graph PnP_nPn?
A graph where all vertices have degree 2.
A tree with exactly two vertices of degree 1 and all others of degree 2.
A graph where all vertices are connected to a central vertex.
A graph with no edges.