Question: Describe how the minimax and alpha-beta algorithms change for two-player, nonzero-sum games in which each player has his or her own utility function. You may assume that each player knows the other's utility function. If there are no constraints on the two terminal utilities, is it possible for any node to be pruned by alpha-beta?