Suppose you have a perfect tree (all leaves at same depth) with a branching factor of 3. Assume the game is zero-sum, the top node is a maximizer and turns always alternate. Assume the tree is always searched from left to right.

(1) Give an example of a tree where over 50% of the leaves can be pruned.

(2) What is the minimum depth for which 75% of the leaves can be pruned? Describe the values of the leaves from left to right. (Hint: once you figure out the pattern to follow, you might want to write a small program.)