3. Consider the following two-player game: Three rows of coins are placed on a table. These rows contain c1,c2, and co coins respectively. On a playe's turn, they must take at least one coin, and may take as many coins as they wish from a single now, out so coins from any other row. two. They could also take 14 coins from the second row, and sono from the other tho. They could tikewise take 13 coins from the third row and none from the other tno. The player who is forced to take the last coin loses the game. (300 pt) a. It the initial configuration is c1=5,c2=4, and c3=3, is it pasible for the first plyer w guarantee a win with optimal play? (300 pt) b. Devise a dynatric programming algorithrn which will, given the threc initial configuratso. values c1,c2, and es dotermines whecher the first player has a winning strategy. (Hint: you hwe a winning strategy if yous have a move which will pat your opponent into a position that dos not have a winning strategy)