Ordered relations: L > U ≥ K and Z < U < R. Which conclusion(s) definitely follow? I) L > Z; II) K < R.

Introduction / Context:
Two chains meet at U. We must compare L and K against Z and R via U.

Given Data / Assumptions:

• L > U ≥ K
• Z < U < R

Concept / Approach:
Bridge through U: since Z is below U and L is above U, then L must exceed Z; and since K is at most U and U is below R, K is below R.

Step-by-Step Solution:
Z < U and L > U ⇒ L > Z (I true). K ≤ U and U < R ⇒ K < R (II true).

Verification / Alternative check:
Example: take Z=1, K=2, U=3, L=4, R=5. Then I and II both hold.

Why Other Options Are Wrong:
a/b/d/e each omit at least one forced relation; both conclusions follow.

Common Pitfalls:
Treating K ≥ U accidentally; the premise is U ≥ K, not the reverse.

Final Answer:
If both conclusions I and II follow