G1: Regular Grammar and G2:Context Free Grammar
Suppose L1= L(G1) and L2 = L(G2)
Take another language such that
L= L1 - L2, if L is empty language then L1 is proper subset of L2
L= L1 - L2
L= L1 ∩ L2c
L2 is CFL which is not closed under complement hence complement of L2 will be CSL
L=Regular ∩ CSL = CSL
And CSL is not closed under emptiness property,
L(R) ⊆ L(G) is undecidable and for any DCFG L(R) ⊆ L(G) is decidable as given in this list
http://gatecse.in/grammar-decidable-and-undecidable-problems/
so this problem is undecidable but semi-decidable which makes option B correct.