In a certain code language, ‘BASED’ is written as

Statements: B ≤ C < E; D ≤ F ≤ G; E = D; A > B

Conclusions:

(i) E ≥ G

(ii) A < E

(iii) B ≤ G

(iv) C < F

Statement: B > C = J; B > S > E; B < N

Conclusion: I. E < C           II. J ≤ E

Statements: B % C & Q @ F $ D; R % B # S

Statement: L ≥ M ≤ R = S; M > N ≥ P

Conclusions: I. P ≤ M II. L > N

Statement: A < Z > I < B > S = O ≤ N

Conclusions:

I. S= N

II. B > O

Statements: Y > U = I; U > H; Z ≤ C ≤ E = Y

Conclusions:

I. U < C

II. E > I

III. I > H

Statements: L # W, W % V, V $ H, H # T

Conclusions : I. V @ T II. H & W III .V # T

Statements: S > P = N ≤ L, O = L > U, U ≥ W > V ≥ U = T

Conclusions:

I. N ≤ W

II. L > T

III. S > T

Statements: M % C & G @ T $ D; W % M # P