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 ?