In Java, write an application that will simulate the Josephus scenario. The user will be allowed

to enter values for the starting index for the counting, the number of people to skip before killing

and the number of people in the circle.

$1.$ You will use a boolean array to represent the circle of people

$2.$ True elements of the array represent a living person, false elements are dead people.

$3.$ When counting upward toward the target number to kill a person, you will not count false

elements. You will only count living people.

$4.$ When the simulation ends, the program should output the safe spot to stand. That is the

last index that is true in the array after the rest were set to false.

$5.$ How you implement this problem is up to you but I require that you use loops for array

traversal.

$6.$ You must also use File I$/$O$.$

The program must write to a file.$$