How many steps will be required to get the final output from the following input? Input: 544, 653, 325, 688, 461, 231, 857

Here the rule followed is: The sum of the digits is calculated. Then in step I, the number with lowest sum of its digits interchanges with the first number. [If the first number has already the lowest sum of its digits then the number with second lowest sum of its digits interchanges with the second number.] The process continues until the numbers get arranged in ascendingorder on the basis of their sum of digits. Input: 544, 653, 325, 688, 461, 231, 857 (13) (14) (10) (22) (11) (6) (20) Step I: 6 14 10 22 11 13 20 Step II: 6 10 14 22 11 13 20 Step III: 6 10 11 22 14 13 20 Step IV: 6 10 11 13 14 22 20 Step V: 6 10 11 13 14 20 22 Hence, (231, 325, 461, 544, 653, 857, 688