Chapter 2.2, Problem 63E

The symmetric difference of A and B, denoted by $A\oplus B$ , is the set containing those elements in either A or B, but not in both A and B.

Show hos’ bitwise operations on bit strings can be used to find these combinations of $A=\left\{a,b,c,d,e\right\}$ , $B=\left\{b,c,d,g,p,t,v\right\}$ , $C=\left\{c,e,i,o,u,x,y,z\right\}$ ,and $D=\left\{d,e,h,i,n,o,t,u,x,y\right\}$ .

   $A\cup B$

   $A\cap B$

   $\left(A\cup D\right)\cap \left(B\cap C\right)$

   $A\cup B\cup B\cup D$