2. Let us play the game "who is the luckiest guy?" There are 26 people sitting on a round table. Let us name them by A, B, . . . , Z, counterclockwise, so that each person is next to two others; for example, A is next to both B and , B is next to both C and A, etc. Starting from A, (s)he will count from number 1, the next person counterclockwise (namely, B) count number 2, so on and so forth. When a multiple of 10 (such as 10, 20, 30, etc) is counted, the person who counts a multiple of 10 will be be forced to leave the table, but the next person counterclockwise to her(him) will continue counting on the next number (so it should be a multiple of 10+1). The game concludes when there is only one person left on the table, and (s)he is the luckiest guy. Now use a computer programming to find who is the luckiest guy