(a) Draw an AVL tree of 12 nodes such that at every node, the right subtrees height and size are minimized, and the left subtrees height and size are maximized. It is OK to omit the keys and focus on the tree shape.

(b) Draw a weight-balanced tree of 12 nodes such that at every node, the right subtrees height and size are minimized, and the left subtrees height and size are maximized. It is OK to omit the keys and focus on the tree shape

(Size means number of nodes for binary search trees.)