Which scheduling algorithm in an operating system

Statements: E * M, M # N, N $ K

Conclusions: a) E * N      b) M $ K

Statements:

A ≥ Z > B ≥ Y; C > B ≥ W

Conclusion:

I. A > W

II. C > Y

Statements: M * T, D % T, D # K, K $ R

Statements: V > R ≥ W < Z; X ≤ W; U < R ≤ Y

Conclusions:

I. X < Z

II. W < Y

III. Z > U 

Statements: Y ≤ A = F; H > T; H < V < F; Y ≤ W < R

Conclusions:

I. Y < V

II. T < A

III. W > H

Statement: Y < Z > I < Q > S = M ≤ N

Conclusions:

I. S= N

II. Q > M

Statements: L ≥ M > N, P > N, T = O ≥ N

Conclusions:

I. T > P

II. L > N

Statement:  C < P > T = E < R; G > R > A < D

Conclusions:

I. T < G

II. G ≥ P

III. T > A

Statements: P % Q, Q & R, R @ S, S # T

Conclusions: I. T & R                        II. P # S