Study the following information carefully and answer the given questions given below:
A word arrangement machine, when given a particular input, rearranges it following a particular rule. The following is the illustration of the input and the steps of arrangement :
Input: top the name good for is here
Step I: is top the name good for there
Step II: is for top the name good there
Step III: is for the top name good there
Step IV: is for the top good name there
(This is the last arrangement and step IV is the last step of this input. )
How many steps will be required to get the final output from the following input ?
Input : where do you go out of way
1) one
2) Three
3) Four
4) Eight
5) None of these

Explanation

5, None of these