For , let u be a fixed vertex of the complete graph . Compute the number of spanning trees of that contain the vertex u as a leaf. Use this to show that the probability a vertex in a tree on n vertices is a leaf is approximately where is the base number for the natural logarithm.