algorithms analysis and design hurry up please

In the Josephus problem J(182) is O a. 191 O b. 109 O c. 190 O d. 19 Array a= {6,1,10, 9, 7, 4, 8, 2, 15 }; After the second iteration of the quick sort the array becomes O a. a={4 1 2 6 7 9 8 10 15} O b. a= {2 1 4 6 7 9 8 10 15} O c. a={6 1 4 2 7 9 8 10 15} O d. a={1 2 4 6 7 9 8 10 15)