(b) Consider the following \"sequential auction\" game with complete infor- mation. There are two bidders. It is common knowledge that bidder 1's valuation of the object is 1, and that bidder 2's valuation of the object is 2. Bidder 1 is asked to first choose a bid from the set {0, 1,2}, which is announced to bidder 2, who then chooses a bid from the set {0, 1,2}. The auction is then decided by the rule of first price auction, namely, the bidder with the highest bid wins and pays his bid and in case of a tie, each bidder wins the object with probability 1/2. Draw the game tree and find all the subgame perfect Nash equilibira in pure strategies