Assuming that both cards in each stack are equally likely, determine the value of the top MAX node. What strategy should Max use in order to get the most advantage?

Consider a game with eight cards (1,2,3,4,5,6,7,8), sorted onto the table in four stacks of two cards each. MAX and MIN each know the contents of each stack, but they don't know which card is on top. Two stacks are on the right and two are on the left. The game proceeds as follows. First, MAX chooses either the left or the right pair of stacks. Second, MIN chooses either the left or the right stack, within the pair that MAX choses. Finally, the top card is revealed. The resulting expectiminimax game tree is as follows