Another way of solving this question can be as below:
We need to find the value of x+y+z to find the value of the remainder when xyz is divided by 9.
Now,
Statement (1):
x+2+y+1+z= 9k where k is any positive integer. (since this sum can not be non-integer as xyz have to integers)
x+y+z+3=9k => x+y+z = 9k-3
Now, the minimum value of x+y+z has to be 6, when k=1 (again x+y+z had to be an integer)
Now, maximum value of x+y+z has to be 27, when x=y=z=largest single digit (digits can be same)=9
Now, what are the multiple of 9 between 6 and 27, inclusive because x+y+z can be 6 and 27 as well. We do not know yet.
Now, 9k can take the value of 9, 18, 27. This means that x+y+z can be 6, 15, 24.
If you divide any of these by 9, the remainer is 6. Hence, sufficient.
This eliminates B,C and E.
Statement (2): xyz = 7k. Now, a given multiple of 7 may or may not be divisible by 7. Hence, insufficient. This eliminates D.
Answer: A