In computer science (Links to an external site.)Links to an external site. and mathematics (Links to an external site.)Links to an external site., the Josephus problem (or Josephus permutation) is a theoretical problem related to a certain counting-out game (Links to an external site.)Links to an external site..

People are standing in a circle (Links to an external site.)Links to an external site. waiting to be executed. Counting begins at a specified point in the circle and proceeds around the circle in a specified 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.

The problem given the number of people, starting point, direction, and number to be skipped is to choose the position in the initial circle to avoid execution.

Write a main program that inputs m (the number of people to skip) and n (the number of people in a circle) from and write and use a class that implements the Queue ADT with linked lists.

Can you write comments on the side of the code and an explanation of what the code is doing? Thank You!!