If in a certain code language ‘+’ represents

Statements: G > N > P = E ≥ H < L; M < E < B < C = Q > X; U > W > Y = Q > H

Conclusions:

I).  U > P

II).  Y > P

Statements: S > U ≥ V = X, Y < M < X, Y = T ≥ W

Conclusions:

I. S > Y

II. M ≤ U

III. W < X

Statements: D ≤ E < L < F; H < I ≤ O = E; G > F > J

Conclusions:

I. H < L

II. J < D

III. G > O

Statements: P > Q = R ≤ S; R > T > U; U = Z ≥ O

Conclusions:

I. P > U

II. O < S

III. R > P

Statements:  T # L # C $ X & Y % E % F

Conclusions:

I. Y @ F

II. Y & F

III. Y & C

Statements: T < I = Q < U ≤ V; U > F; J = U ≤ E

Conclusions:

I. E > Q

II. V ≥ T

III. T < V

IV. F = T

Statements:

L ≤ J ≤ C = N; W ≥ X > L

Conclusions:

I. J ≤ X

II. X ˃ W

Statements:

P ≤ M < X > K; X < S > T; T < U < V

Conclusions:

I).  P < S

II).  P ≥ S