The key insight on this one is hidden in Statement 1. Most people test a couple arrangements and call it insufficient. But there's actually only one valid arrangement, which is what makes this a great Data Sufficiency trap.
Statement 1: 6 distinct values, each >= 4, max > 12, total = 43.
Minimum with all distinct integers >= 4: 4+5+6+7+8+9 = 39. We need 4 more. And since max > 12, replace the highest with at least 13:
Try max = 13: 4+5+6+7+8+13 = 43. Fits perfectly.
Try max = 14: 4+5+6+7+8+14 = 44, but that's already over 43. You'd have to lower something else, but 4,5,6,7,8 are already the minimum. No valid arrangement with max = 14.
So Statement 1 locks in exactly one set: {4, 5, 6, 7, 8, 13}.
Still doesn't tell us which number is Nora's. She could be any of them. Nora's count could be 4 or could be 13. Insufficient alone.
Statement 2: Nora packed fewer bags than the median of the six volunteers.
Without knowing the actual values, we can't pin down whether Nora is above or below 6. Insufficient alone.
Both together:
Set is fixed as {4, 5, 6, 7, 8, 13}. Median = (6+7)/2 = 6.5.
Nora < 6.5, so Nora packed 4, 5, or 6. In all cases, Nora packed 6 or fewer.
The answer to "did Nora pack more than 6?" is a definitive NO.
Answer: C
The trap is giving up on S1 too early. Once you realize the constraints force exactly one set of values, the problem becomes much cleaner.