Which of the following is/are true about the minimax algorithm with alpha-beta pruning? Assume a 2-player game where the only outcomes are win, loss or draw. An algorithm is called complete when, if there is a way for the player to win, then the algorithm will find it. The notion of optimality is that it must find the sequence of the least number of moves which guarantees a win.
a. The algorithm is complete for the finite tree
b. The algorithm is optimal for the finite tree
c. Worst case space complexity of the algorithm is O(bm)
d. Worst case time complexity of the algorithm is O(b^m)