A number arrangement machine, when given a particular input, rearranges it following a particular rule. The following is the illustration of the input and the steps of arrangement: Input: 41, 19, 218, 229, 317, 64, 107 Step I: 317, 19, 218, 229, 41, 64, 107 Step II: 317, 229, 19, 218, 41, 64, 107 These steps get repeated thereafter. In how many steps would the following input be fully arranged? Input: 689, 722, 382,

Step-by-step solution

Here the rule followed is the numbers are getting arranged in descending order. Step I: The largest of the given numbers interchanges its place with the first number. [In case the largest number is already arranged, the second largest is interchanged with the number next to the largest and so on.] Step II: The same process as that of step I will happen here but in this step, nos. will be shifted rightwards instead of interchange.