In JAVA

Solve the Josephus problem by using a circularly linked list.

The Josephus problem (or Josephus permutation) is a theoretical problem related to a certain counting-out game People are standing in a circle waiting to be executed. The counting begins at a specified point in the circle and proceeds around the circle in a fixed direction. After a specified number of people are skipped, the next person is executed. The procedure is repeated with the remaining people, starting with the next person, going in the same direction and skipping the same number of people, until only one person remains, and is freed. Given the total number of people n, and a number k which indicates that k-1 persons are skipped and the kth person is executed, the task is to write a program that can choose the position in the initial circle to avoid execution