Can someone help with this?

1. (10 marks) Recall the optimal binary search tree algorithm we saw in class that minimizes the expected weight of the tree. Lets define a weight balanced tree as a binary tree such that at every non-leaf node, v, the number of nodes in each of its subtrees is at least one quarter of the total number of nodes in the subtree with root is a weight balanced tree. That is, the optimization has to be limited to weight balanced trees. inary search tree algori 1. (10 marks) Recall the optimal binary search tree algorithm we saw in class that minimizes the expected weight of the tree. Lets define a weight balanced tree as a binary tree such that at every non-leaf node, v, the number of nodes in each of its subtrees is at least one quarter of the total number of nodes in the subtree with root is a weight balanced tree. That is, the optimization has to be limited to weight balanced trees. inary search tree algori