in minmax search, we used a depth-first exploration through the use of recursion. we know that minmax gives an optimal solution, however, we also know that depth-first search is suboptimal. explain why minmax gives an optimal solution even when it is using a depth-first exploration.
