public class Josephus $\{$ public static void main$($String$[]$ args$)\{$ boolean$[]$ people $=\{$true$,$ true, true, true, true, true, true, true, true, true$\}$; int loopCounter $=0$; int numLiving $=$ people.length; int killCounter $=0$; int skipCount $=2$; while $($numLiving $>1)\{$ if $($people$[$loopCounter$])\{$ killCounter$++$; if $($killCounter $==$ skipCount$)\{$ people$[$loopCounter$]=$ false; numLiving$--$; killCounter $=0$; $\}\}$ loopCounter$++$; if $($loopCounter $==$ people.length$)\{$ loopCounter $=0$; $\}\}$ for $($int i $=0$; i $<$ people.length; i$++)\{$ if $($people$[$i$])\{$ System.out.println$("$The safe spot is: $"+$ i$)$; break; $\}\}\}\}$You will write an application that will simulate the Josephus scenario. The user will be allowedto enter values for the starting index for the counting, the number of people to skip before killingand the number of people in the circle$\mathrm{.}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$\mathrm{.}3.$ When counting upward toward the target number to kill a person, you will not count falseelements. You will only count living people$\mathrm{.}4.$ When the simulation ends, the program should output the safe spot to stand. That is thelast index that is true in the array after the rest were set to false$\mathrm{.}5.$ How you implement this problem is up to you but I require that you use loops for arraytraversalCan you check if these requirements are matching the code I did