A word arrangement machine, when given a ular input, rearranges it following a particular rule. The following is illustration of the input and the steps of arrangement:
Input: 87, 321, 293, 47 ,176, 409, 215
step I:47,321,293,87,176,409,215
step III: 47,87,293,321,176,215,409
Step IV:47,87,293,215,176 ,321,409
Step V: 47 ,87 ,176 ,215, 293, 321 ,409
This is the final arrangement and step V is the last step for this input.
How many steps will be required to get the final output from the following
input? Input: 182 317 67 249 417 91 293

Options

A. 3
B. 4
C. 5
D. 6

Explanation

The logic is very simple: alphabetical arrangement
1st lot: tod tex til ide nol lux ros
2nd lot: ide tod tex til nol lux ros
3rd lot: ide lux tod tex til nol ros
4th lot: ide lux nol tod tex til ros
Input: 182 317 67 249 417 91 293
Step I: 67 317 182 249 417 91 293
Step II: 67 317 182 249 293 91 417
Step III: 67 91 182 249 293 317 417