Question 1 1. Minimax is an algorithm that can be used maximize the minimum value of an opponent in a game. True False Question 2 2. An exhaustive search will search an entire decision tree. True False Question 3 3. A short circuit is allows an algorithm to stop searching when an exact solution is found. True False Question 4 4. A random search will search a decision tree randomly in hope of finding a solution. True False Question 5 5. Which of the following can be solved using a decision tree? Subset Sum Knapsack Traveling Salesman All of the above