This would be in logical reasoning, and I would classify this as a 'quantifier' question. However, you won't ever see a question exactly like this on the LSAT. This question was made for drilling. However, the underlying fundamentals of this question will be on the LSAT, but they'll likely use terms instead of letters.
These drills are extremely important to get you used to understanding how to diagram quantifiers. On the LSAT, you will have some questions where you need to digram them since there are quantifiers in the stimulus.
For this question, we have
P: X - some - Y P: C: Z - some - Y
What can we add to conclude Z - some - Y?
We need to connect X and Z
X - >Z (not Z - >not X) X - some - Y
With this, we could conclude Z - some - Y
Y - some - X - >Z
Y - some - Z (Z - some - Y)
Does this make sense? Let us know if you have any questions!
