Two players can allocate ten indivisible desirable identical objects among themselves. Find the pure-strategy Nash equilibria of the following two games.

(a) The players simultaneously submit demands, members of {0,1,dots,10}. If the sum of the demands is at most 10 , each player gets what he demands. Otherwise, both get 0 .