Provide a lower bound and an upper bound on the maximum rank of a node in a binary tree with n nodes. In other words, derive the largest and smallest size of arn array needed to hold such a tree. You may use the notation