Question 2: Players A and Player B will compete to reach a destination point. The player who first reaches the destination point will win the game. O, the starting point; 100 is the destination point (the winner player can exceed 100 in the last roll of dice). By rolling a dice, the players progress according to the number of the dice. The algorithm operates on the following assumptions. When players come to a two-digit number, if the number is a palindromic number, they have to move back 1 step. When it comes to a number divisible by 10, the players move forward 2 steps. The program can decide the priority of starting the game by a method. For example Start 10 11 0 1 2 3 4 12 13 14 End . 20 21 22 23 100 Write a java program that finds the winning player. Your solution should include methods to perform each of the steps shown above. Display that how many times was the dice rolled when the game was completed and how many steps did the winning player finish the game