The minimax algorithm assumes that players take turns moving, but in card games such as whist and bridge, the winner of the previous trick plays first on the next trick.

a. Modify the algorithm to work properly for these games. You may assume that a function WINNER(Si)s available that reports which player won the trick just completed (if any).

b. Draw the game tree for the first pair of hands shown on page 179.