A weight balanced tree is a binary tree in which for each node, the no. of nodes in the left sub tree is atleast half and at most twice the no. of nodes in the right sub tree. The maximum possible height of such a tree with n nodes is best described by which of the following?
(a) log2 n (b) log4/3 n
(c) log3 n (d) log3/2 n