Alice and Bob are playing a game. There are initially n \geq 1 stones in a pile. Alice and Bob take turns, with Alice going first. On their turn, Alice or Bob roll a die with numbered faces 1,1,2,2,3,3, and take at least one and at most that many stones from the pile as the rolled number on the dice. The person who takes the last stone wins.
(a) If n=2, what is the probability that Alice wins?
(b) What is the smallest value of n for which Bob is more likely to win than Alice?
(c) Find all values n for which Bob is more likely to win than Alice.