1)Suppose the game tree for a particular problem has a branching factor of b. If you build a balanced tree at depth d and then apply minimax on this game tree, how many nodes will you expand at depth d?

2)What is the time complexity of minimax algorithm with alpha beta pruning on a tree of branch factor b and depth d?

3)Apply Alpha-Beta Pruning on the following game tree and circle the pruning nodes:

<>

<> <> <>

<> <> <> <><><> <><><>

3 12 8 2 1 12 12 5 2

**Couldn't use arrows bc picture will not paste, hopefully you can still understand. The numbers are attached to the bottom 9 boxes