A word arrangement machine, when given an input line of words, rearranges them following a particula

A word arrangement machine, when given an input line of words, rearranges them following a particular rule in each step. The following is an illustration of input and the steps rearrangement. (and Step VII is the last step for this input)
As per the rules followed in the above steps, find out in the given questions the appropriate step for the given input.
Input :- Go for to Though By easy To Access at
Step I :- Access Go for th Though By easy To at
Step II :- Access at Go for to Though By easy To
Step III :- Access at By Go for to Though easy To
Step IV :- Access at By easy Go for to Though To
Step V :- Access at By easy for Go to Though To
Step VI :- Access at By easy for Go Though to To
Step VII :- Access at By easy for Go Though To to -> Input : Together over series on feast the so
Which of the following steps will be the last but one ?

A. II

B. III

C. IV

D. V

E. None of these

Answer: D. V

In the given arrangement, the words have been arranged alphabetically in a sequence, altering the position of only one word in each step.

Input :- Together over series on feast the so
Step I :- feast Together over series on the so
Step II :- feast on Together over series the so
Step III :- feast on over Together series the so
Step IV :- feast on over series Together the so
Step V :- feast on over series so Together the
Step VI :- feast on over series so the Together

Clearly, Step VI is the last step and V is the last but one (second last).

Posted in: Type 1 - Sequential Output Tracing - Verbal Reasoning