hello i need solution for this question please. and also make sure you show me all steps to solve it please.

this is from:

Algorithms and Complexity

Note: this problem is only for those looking for some mental challenges: it may need some serious thinking. Strictly speaking, this problem is more about logic and analysis than algorithms. However, logic reasoning and analysis are key to algorithm designa nd analysis. So it would be good if you have these skills. Do this only when you have time and energy after finishing the other problems. There are nine cards with numbers from 1 to 9 consecutively (i.e. 1 to 9 inclusively and no repeating numbers). Two players, Amy and Bob, take turns in drawing one card each time. A player wins when he or she has three cards who numbers sum to 15. The game is a draw if neither players has three cards adding to 15. Note: a player can take more than three cards; as long as there are three cards adding to 15, the player wins. Now suppose Amy is the one to start the game. Can Amy always win no matter what Bob does? Justify your answer.