(6pts) Fill in the six blanks to complete the proof that a binary tree of n nodes has the depth at least lg(n + 1)-1 where Ign = log2n 3. max, lg, max You must use them to express lg and max. Add an extra space at the end of each keystroke and variable Allowed key strokes: lg o Put a pair of parentheses to avoid any ambiguity. - max (x, y) : the maximum of x, y -Vg (x-y): lg of x-y. Don't write \Ig x-y unless you mean (Vg x)-y t be filled with the case-sensitive shortest possible expression