Data Sufficiency — Colour naming code: What is the colour name (in this code language) for fresh grass? Statements: I. “Blue” is called “green”, “red” is called “orange”, “orange” is called “yellow”. II. “Yellow” is called “white”, “white” is called “black”, “green” is called “brown”, and “brown” is called “purple”.

Introduction / Context:
These puzzles relabel standard colour words. The question asks what fresh grass would be called in this system. Fresh grass is normally green; we must map the word “green” to its coded name using the provided statements and test sufficiency.

Given Data / Assumptions:

• I: Blue→“green”, Red→“orange”, Orange→“yellow”.
• II: Yellow→“white”, White→“black”, Green→“brown”, Brown→“purple”.
• We need the code name for the natural colour “green”.

Concept / Approach:
Identify which statement contains the mapping for the base colour of fresh grass. Since fresh grass is green, we require the relabelling for “green.” If Statement II directly gives it, then II alone suffices.

Step-by-Step Solution:
Target: Code name for “green”.Statement II explicitly states: Green→“brown”.Therefore, fresh grass would be called “brown”.Statement I does not mention “green” as an input colour; it only defines names for blue, red, and orange.

Verification / Alternative check:
No chaining is required beyond the single mapping because the question is about the base colour “green,” not about what “brown” might then be further called.

Why Other Options Are Wrong:

• I alone: Does not map “green”.
• Either alone / Both: II alone already answers; both together are not required.
• Neither: Incorrect because II suffices.

Common Pitfalls:

• Over-chaining mappings (e.g., trying to trace multiple steps) when a direct mapping is provided.
• Confusing the natural colour of grass with its new coded label.

Final Answer:
II alone is sufficient while I alone is not sufficient