For Option C
Any $LR(k)$ grammar is equivalent to $LR(1)$ grammar, which is equivalent to DCFG
Hence, $LR(k)$ is expressively as powerful as DCFG, and not CFG as a whole.
Or, simply you can disprove Option C by taking an ambiguous CFG. Any ambiguous grammar can't be parsed by a parser (except Operator Precedence Parser)