Write a program to solve the Josephus problem described in Exercise . Use output statements to trace the selection process, showing the contents of the list at each stage.
Exercise ,
In the Josephus problem, a group of soldiers is surrounded by the enemy, and one soldier is to be selected to ride for help. The selection is made in the following manner:
An integer n and a soldier are selected randomly. The soldiers are arranged in a circle and they count off beginning with the randomly selected soldier. When the count reaches n, that soldier is removed from the circle, and the counting begins again with the next soldier.
This process continues until only one soldier remains, who are the (un)fortunate one selected to ride for help. Write an algorithm to implement this selection strategy, assuming that a circular linked list is used to store the names (or numbers) of the soldiers.