A group of 2n - 1 router is interconnected in a centralized binary tree, with a router at each tree node. Router i communicate with router j by sending a message to the root of the tree. The root then sends the message back down to j. Derive an approximate expression for the mean number of hops per message for large n, assuming that all router pairs are equally likely.