Concept:
Decimal-to-binary conversion follows a systematic algorithm based on repeated division by 2. Every step must be performed in a specific order to obtain the correct binary representation.
Step 1: Identify the first operation.
The process begins by dividing the decimal number by 2.
Therefore, the first step is:
\[
(ii)
\]
Step 2: Record the remainder.
After every division, the remainder must be noted because it becomes part of the binary representation.
Therefore, the second step is:
\[
(iii)
\]
Step 3: Continue the process.
The quotient obtained from the division is again divided by 2.
This procedure is repeated until the quotient becomes zero.
Therefore, the third step is:
\[
(i)
\]
Step 4: Construct the binary number.
The remainders are generated from least significant bit to most significant bit.
To obtain the final binary number, the remainders are written in reverse order.
Therefore, the final step is:
\[
(iv)
\]
Step 5: Write the complete sequence.
Hence, the correct order is:
\[
(ii)\rightarrow(iii)\rightarrow(i)\rightarrow(iv)
\]
Therefore, the correct answer is:
\[
\boxed{(B)}
\]