Let DCFG = { | G is a CFG and L(G) contains exactly k strings where 0 < k < 10}. Show that DCFG is decidable.