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.
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 (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 : Over Go For through at one
Which step number will be the last step of the above input ?

A. III

B. V

C. VI

D. VII

E. None of these

Answer: E. None of these

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

Input :- Over Go For through at one
Step I :- at Over Go For through one
Step II :- at For Over Go through one
Step III :- at For Go Over through one
Step IV :- at For Go one Over through

Since all the words in the given input have been arranged alphabetically uptil Step IV, so it is the last step.

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