(12 points) Fill in the following table. Be very careful to get the exact values. Most of the credit will be for the last column. Don't use the AVL approximation formula (H < 1.44log(...)). Instead, draw trees and look for the patterns, like we did on day 13 in class.

Feel free to include explanations of your answers. correct_answer full_credit. wrong_answer + no_explanation no_credit.

1/2 point for each entry in the first two columns, and 2 points each for each entry in the last column.

n	Height of shortest binary tree with n nodes	Height of tallest binary tree with n nodes	Height of tallest AVL tree with n nodes
7	2	6	3
8
370
17000
50000