These are somewhat famous divisibility tests for 7, if you learn about those sorts of things (they're never useful on the GMAT, so there's no reason to), and the answer here is D.
One would normally prove these tests work using modular arithmetic, which is beyond the scope of the GMAT. We don't strictly need to use it:.
From Statement 1, 10A + B - 2C is divisible by 7. So it equals some multiple of 7, which we can write as 7q. Then if we multiply by 10 on both sides, and rewrite things to get 100A + 10B + C (which is the three digit number ABC) we find:
10A + B - 2C = 7q
100A + 10b - 20C = 70q
100A + 10B + C - 21C = 70q
100A + 10B + C = 70q + 21C
and since we're adding two multiples of 7 on the right side, the right side is divisible by 7, so the left side must be also, since it's the same number as the right side. So the three-digit number ABC is divisible by 7 and Statement 1 is sufficient.
Using Statement 2, if 2A + 3B + C is divisible by 7, then we must get another multiple of 7 if we add 98A, because 98A is divisible by 7 (since 98 = 7*14). We must also get a multiple of 7 if we add 7B. So if 2A + 3B + C is divisible by 7, so is 2A + 98A + 3B + 7B + C = 100A + 10B + C, but that's the three-digit number ABC. So Statement 2 is sufficient.
But I wouldn't expect a question on the real GMAT to expect a test taker to complete that kind of analysis.
_________________
http://www.ianstewartgmat.com