Math, asked by tpgad73011, 8 months ago

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.
Input: gone are take enough brought station
Step 1: take gone are enough brought station
Step 2: take are gone enough brought station
Step 3: take are station gone enough brought
Step 4: take are station brought gone enough
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:
Input: car on star quick demand fat
What will be the third step for this input ?

A) star car demand quick on fat B) star quick car demand on fat C) star car quick demand on fat D) none of these

Answers

Answered by tanu2418
2

Answer:

C) star car quick demand on fat....

Mark me as brainliest...

Step-by-step explanation:

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 fat

Step1: star car on quick demand fat

Step2: star car quick on demand fat

Step3: star car quick demand on fat

Hence, the answer is C

Similar questions