Daksh is taller than Manick but not as tall as Rohan. Somesh is shorter than…

Concept: In a ranking/ordering puzzle, convert each comparative sentence into an inequality chain, then merge the chains that share a common person. Two people can only be ranked against each other if some chain, directly or transitively, connects them — if no such link exists, their relative order, and hence which of them is the overall extreme (tallest/shortest), stays undetermined.

Application:

1. From “Daksh is taller than Manick but not as tall as Rohan”: Rohan > Daksh > Manick.

2. From “Somesh is shorter than Daksh but taller than Farhan”: Daksh > Somesh > Farhan.

3. Merging the two chains on the shared person Daksh gives Rohan > Daksh, with Daksh > Manick on one branch and Daksh > Somesh > Farhan on another branch.

4. No statement links Manick to Somesh or to Farhan, so Manick's position relative to that second branch cannot be fixed — he could sit above Somesh, between Somesh and Farhan, or below Farhan.

Cross-check: each of the orderings below is fully consistent with both given statements:

• Rohan > Daksh > Manick > Somesh > Farhan (Farhan is last)

• Rohan > Daksh > Somesh > Manick > Farhan (Farhan is last)

• Rohan > Daksh > Somesh > Farhan > Manick (Manick is last)

Since the last-placed person changes across these equally valid orderings, the shortest person cannot be determined from the given information.