Exercise 5. (Josephus Problem) 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 N and M 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) $ java Josephus 7 2 1 3 5 0 4 2 6 2 j $ java Josephus 2 5 8 11 14 17 0 4 9 13 18 3 10 16 6 15 7 1 12 19 1onp2 20 3 13 18 3 10 16 6 15 7 1 12 19 import edu.princeton.cs. algs4.Queue; import edu.princeton.cs.algs4.StdOut; public class Josephus [ public static void main(String[] args) Get M and N from command line as ints /7 Create a queue q and enqueue integers int i - 0; // As long as q is not empty: increment i; // dequeue an element pos; if M divides i, //write pos, otherwise enqueue pos / Dequeue and write the remaining element / from q Josephus, java