Question 172
Let $n$ be a positive integer. There are $n$ islands, and you want to build some number of bridges so that there is a path between any two islands. (Each bridge joins a pair of islands, and can be traveled in both directions.) At least how many bridges must you build?