Question

Let M = {letters of the word REAL} and

N = {letters of the word LARE}. 

Write sets M and N in roster from and then state whether;

(i) M  ⊆ N is tree.

(ii) N  ⊆ M is true.

(iii) M = N is true.

Answer 1

Let M = {letters of the word REAL}