Study the following information and answer the question. Each of five friends A, B, C, D and E travels a different distance from home to the workplace. B travels 15 kilometres to reach the office. A travels more than B but less than E. D travels more than only C, meaning D is second from the bottom when the distances are arranged in increasing order. The friend who travels the maximum distance covers 30 kilometres. Who among the following can possibly be the one who travels 5 kilometres to reach the workplace?

Introduction / Context:
This verbal reasoning question deals with ordering and inequality relationships among distances travelled by five friends. Instead of exact values for all, we are given partial comparisons such as who travels more than whom and the fact that all distances are distinct. The question aims to test your ability to translate statements into a logical ordering and then deduce which friend could travel a particular distance, in this case 5 kilometres, without contradicting any of the conditions.

Given Data / Assumptions:

• There are five friends: A, B, C, D and E.
• Each friend travels a different distance to his or her workplace.
• B travels exactly 15 kilometres.
• A travels more than B but less than E, so B < A < E.
• D travels more than only C, so C has the shortest distance and D is the second shortest.
• The friend who travels the most covers 30 kilometres.
• All distances are positive and distinct.

Concept / Approach:
We are essentially arranging five distinct distances in increasing order using inequality information. First, we identify who is definitely smallest or largest based on phrases like "more than only C" and "the one who travels the most". Then we look at the given exact value for B and check where B can fit in the order. Finally we test which person can logically have a distance of 5 kilometres without violating any of the constraints. Reasoning with a model example of distances is often the clearest way to see this.

Step-by-Step Solution:
Step 1: From the statement that D travels more than only C, we know that C is the shortest and D is the second shortest. Therefore the increasing order of distances starts with C, then D, followed by three others. Step 2: B, A and E must therefore travel further than D. Symbolically we have: C < D < B, A, E (in some order). Step 3: We also know that A travels more than B but less than E, so B < A < E. Combining, the full order from smallest to largest is: C < D < B < A < E. Step 4: The largest distance is 30 kilometres. The only candidate that can take this maximum role in the chain C < D < B < A < E is E, so E = 30 kilometres. Step 5: B travels exactly 15 kilometres. Since C and D are shorter, their distances must be less than 15 and distinct. Step 6: The question asks who can possibly travel 5 kilometres. The shortest distance must belong to C, so if any friend can travel 5 kilometres, it has to be C. Step 7: We can construct a consistent example: let C = 5, D = 10, B = 15, A = 20 and E = 30. All inequalities and conditions are satisfied, so this arrangement is valid and shows that C can indeed travel 5 kilometres.

Verification / Alternative check:
We should verify that none of the other friends can consistently be assigned 5 kilometres. D cannot travel 5 kilometres because D is second from the bottom, so C must be strictly shorter. B cannot travel 5 kilometres because B's distance is given as 15 kilometres. A and E are both greater than B, so they certainly cannot be at 5 kilometres. Therefore C is the only candidate who can logically and consistently travel 5 kilometres, which agrees with the model arrangement constructed earlier.

Why Other Options Are Wrong:

• Option A, A, is impossible because A must travel more than 15 kilometres.
• Option C, D, is incorrect because D is second from the bottom and must have a distance strictly greater than C.
• Option D, E, is the one with the maximum distance, 30 kilometres, so E unquestionably cannot be at 5 kilometres.
• Option E, B, is ruled out by the explicit statement that B travels exactly 15 kilometres.

Common Pitfalls:
A frequent error is to misread "D travels more than only C" and assume it means D travels the most, when it actually states that only C is shorter, so D is second from the bottom. Another trap is to forget that all distances are distinct. Some learners also neglect the fixed distance of B and try to assign arbitrary small values to B, which contradicts the data. Drawing a simple ordered list, such as C < D < B < A < E, helps keep the relationships clear.

Final Answer:
The only friend who can consistently travel 5 kilometres without violating any condition is C.