Logical Sentence Arrangement Questions

A word machine when given a sentence as input, it rearranges the sentence using a particular rule. Below is given an example sentence and the rearrangement steps.Using this logic you have to find the answer for below questions
Input : Do not beat around the bush.
Step 1 : around do not beat the bush
Step 2 : around beat do not the bush

Step 3 : around beat bush do not the.
Question 1
Input : May sure you use correct english
Among the following options which would be the last output ?
a) correct may sure you use english
b) correct english may sure use you
c) correct english may sure you use
d) correct english may you sure use
Answer : b) correct english may sure use you
Reason :
From the question we can say that the sentence is arranged using alphabetical order. If the same logic is applied to the above input, in the first step the output will be
1) correct may sure you use english
i.e Among the words in the sentence, correct is the word starting with c so moved to the first position. In the second step english will be moved and you will get ,
2) correct english may sure you use
Finally use has to be moved before you because other words are in the order, then the output will be 3) correct english may sure use you.
This is the last output so correct english may sure use you.
Question 2
Input : Emphasize on your qualifications
How many steps are required to rearrange the above sentence.
a)5 b)3 c) 6 d) None of these
Answer : d) None of these
Reason :
The above sentence will be rearranged in single step itself i.e emphasize qualification on your. So the answer is none of these.
Question 3
Input : Don't rush up to finish all the questions
Which sentence will be the output of the 1 step before the last line ?
a) all don't finish questions rush the to top
b) all don't finish rush up to the questions
c) all don't finish question rush the up to
d) all don't rush up to finish the questions
Answer : c) all don't finish question rush the up to
Reason :
Let's see the output of each step :
Step 1 : all don't rush up to finish the questions
Step 2 : all don't finish rush up to the questions
Step 3 : all don't finish questions rush up to the
Step 4 : all don't finish questions rush the up to
Step 5 : all don't finish questions rush the to up
Here we have 2 letters starting with ' T '. Similarly in the example sentence we have 2 letters starting with ' B '. The logic used is, if the two words have same starting letter, then they arranged with the second letter in alphabetical order i.e. 'h' in 'the' should come first and then 'to'
So the output in the last before step i.e. 4th step is "all don't finish questions rush the up to" which is the answer.