Picture clear ·maxp.e*log(1/e*)∑vp(N)[H(X)-H(e*)]t Very complicated.Compare to Index where the tree is completely binary and each H(δ)=1(i.e.δv=1/2): [Thm]the maximization is achieved by a complete binary tree with o=1/2 everywhere.Picture clear • maxT,p,ε* log(1/ε*)∙∑vp(v)[H(Xv )-H(ε*)]+ • Very complicated. Compare to Index where the tree is completely binary and each H(δv ) = 1 (i.e. δv=1/2). • [Thm] the maximization is achieved by a complete binary tree with δv=1/2 everywhere