R&D or The Dollar Auction Game Two players, A and B, bid for an object worth 3 dollars to each. Players bid alternately (assume that player A starts the bidding process), and all bids are in positive integers. At each round, the player who bids can either give up (and make no bid) or else he has to (strictly) overbid the last bid. Each player has a budget constraint of 3 dollars. The object is awarded to the highest bidder, but all players pay their own nal bids. a) Solve for the Subgame Perfect Equilibria(um) of this game