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.

The Step II of an input is as follows :
and Do pet to on that
Which of the following would definitely be the input ?

A. Do on pet to and that
B. Do pet to and that on
C. Do and pet to on that
D. Cannot be determined
E. None of these
Answer: E . None of these


Clearly, none of the given input gives the desired output at Step II on rearrangement.

Back to Sequential Output Tracing