HMMT 2009 S2

In a connected graph, it is possible to reach any vertex from any other vertex by following the edges. A tree is a connected graph with $n$ vertices and $n-1$ edges for some positive integer $n$. Suppose $n \geq 2$. What is the chromatic number of a tree having $n$ vertices? Prove your answer.