There are k stones on the table. Alper, Betul and Ceyhun take one or two stones from the table one by one. The player who cannot make a move loses the game and then the game finishes. The game is played once for each k=5,6,7,8,9. If Alper is always the first player, for how many of the games can Alper guarantee that he does not lose the game? <spanclass=′latex−bold′>(A)</span>1<spanclass=′latex−bold′>(B)</span>2<spanclass=′latex−bold′>(C)</span>3<spanclass=′latex−bold′>(D)</span>4<spanclass=′latex−bold′>(E)</span>5