14 Prove that alpha–beta pruning takes time O(2 ) with optimal move ordering, where m is the maximum depth of the game tree.