Consider the game tree below in which the first player is trying to maximize her score, fill in each box with the value returned by the standard alpha-beta algorithm if the tree is processed from left to right. And cross out both leaves and non-leaf nodes that need not be examined or considered. MAX MIN MAX . 2 2 1 9 5 3 1 5 4 7 5 A BI 00 G