A word arrangement machine, When given an input line of words, rearranges it in every step following a certain rule. Following is an illustration of an input line of words and various steps of rearrangement. <br />Input: gone are take enough brought station<br />Step 1: take gone are enough brought station<br />Step 2: take are gone enough brought station<br />Step 3: take are station gone enough brought<br />Step 4: take are station brought gone enough<br />And Step 4 is the last step for this input. Now, find out an appropriate step in the following question following the above rule. Question:<br />Input: car on star quick demand fat<br />What will be the third step for this input ?

Correct Answer: star car quick demand on fat

Obsrving the given arrangement, we find the following pattern:If we arrange the words in the given input in the alphabetical order and then label them as 1,2,3,4,5,6, then the last step contains the words in the order 6,1,5,2,4,3. However, the position of only one word is alteredat each step.Input:car on star quick demand fatStep1: star car on quick demand fatStep2: star car quick on demand fatStep3: star car quick demand on fat

Hence, the answer is C