Suppose that we have the following auction scheme. There are two bidders, and an item to be allocated to them. Each bidder submits a bid. The highest bidder gets the good, but both bidders pay their bids. Consider the case in which bidder 1 values the item at 3, while bidder 2 values the item at 5; this is commonly known. Each bidder can only submit one of three bids: 0, 1 or 2. If player i bids more than player j, player i gets the good and both pay. If both players bid the same amount, each gets the item with probability 0.5, but again, both pay. (a) Write down the game in matrix form. Which strategies survive IESDS? (b) Find the NE of the game. (Discrete all pay auction with bribes)