Q. 11 A set X can be represented by an array x[n] as follows
Consider the following algorithm in which x,y and z are boolean arrays of size n;
algorithm zzz(x[], y[], z[]) { int i; for(i=; i<n; ++i) z[i] = (x[i] ∧ ~y[i]) ∨ (~x[i] ∧ y[i]); }
The set Z computed by the algorithm is 
Answer: (D)
Explanation: 
