(Discrete Math)

Please show all work!

(2a) Use a tree (which you should draw on the facing page) to 6 generate, list, and count the number of elements in the set W of all 2-letter words in the alphabet fa, b,c, d) such that 3 (i) order does not matter and repetition is allowed, and Wrd((2,[a, b, c,d],oM, RA) v(Wrd(2, (a, b,c,d).oM, RA)) 3 (ii) order does not matter and repetition is not allowed Wrd((2, [a, b,c,d],oM, RA)) v Wrd((2, a.b,c,d],oM,RA))) (2a) Use a tree (which you should draw on the facing page) to 6 generate, list, and count the number of elements in the set W of all 2-letter words in the alphabet fa, b,c, d) such that 3 (i) order does not matter and repetition is allowed, and Wrd((2,[a, b, c,d],oM, RA) v(Wrd(2, (a, b,c,d).oM, RA)) 3 (ii) order does not matter and repetition is not allowed Wrd((2, [a, b,c,d],oM, RA)) v Wrd((2, a.b,c,d],oM,RA)))