CREATIVE PROBLEM 1.3.37 JOSEPHUS PROBLEM (see http://mathworld.wolfram.com/JosephusProblem.html) In the Josephus problem from antiquity, N people are in dire straits and agree to the following strategy to reduce the population. They arrange themselves in a circle (at positions numbered from 0 to N???1) and proceed around the circle, eliminating every Mth person until only one person is left. Legend has it that Josephus figured out where to sit to avoid being eliminated. Write a Queue client Josephus.java that takes M and N from the command line and prints out the order in which people are eliminated (and thus would show Josephus where to sit in the circle). /************************************************************************* * Compilation: javac Josephus.java * Execution: java Josephus M N * Dependencies: Queue.java * * Solves the Josephus problem. * * % java Josephus 2 7 * 1 3 5 0 4 2 6 * *************************************************************************/Josephus.java IS SORTED ALPHABETICALLY...REWRITE IT CORRECTLY SO THAT IT COMPILES AND SOLVES THE JOSEPHUS PROBLEM

_____________________________________________________________

 // initialize the queue

{

{

{

} 

}

}

for (int i = 0; i < M-1; i++)

for (int i = 0; i < N; i++)

int M = Integer.parseInt(args[0]);

int N = Integer.parseInt(args[1]);

public class Josephus 

public static void main(String[] args) 

q.enqueue(i);

q.enqueue(q.dequeue());

Queue q = new Queue();

StdOut.print(q.dequeue() + " ");

StdOut.println();

while (!q.isEmpty())