Find the no. of words formed by using all the letter of

Statement:  A = B ≥ C ≥ D < E < F ≥ G; D > H

Conclusion:

I.  H ≥ G

II.  A > H

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

Conclusion:

I. C = G

II. A > F

Statements:

O ≤ P = Y ≤ U; L > G ≥ W = Q ≥ Y; G < A ≤ R < D

Conclusions:

I. P < R

II. G ≥ P

Statements: N < G ≥ F > E ≥ D, D = O ≥ I > P

Conclusions:

I. D < G

II. N > I

III. P < E

Statements: P = Q = R > S > T > Z; U > R < V < W > X

Conclusions:

I. W > Z

II. R < W

III. R < X

Statements: N = Q < X ≤ L, L > T = G ≥ E

Conclusions:

I. L ≥ Q

II. G > X

III. L > N

Statements: W ≤ T = R; T < U < S; X = W ≥ Y

Conclusions:

I. S > Y

II. W ≥ S

III. U ≥ Y

Statements: L ≤ Y = T ≤ S; S = F ≤ U; K > N = U

Conclusions:

I. K > T

II. U ≥ L

Statements: J > K = L ≥ N > M > O ≥ P

Conclusions:

I. K ≥ O

II. J = N

III. P < N