Answer given is correct.
L(G1) : Language of all ambigous grammar... so what's is this language it's inherently ambigous language
L(G2) : Language of all unambigous grammar... this means every grammar produces here the language that's not ambiguous. So how can they both be equivalent ??
L(G3) : Language of left recursive grammar
L(G4) : Language of right recursive grammar
We know that every left recursive grammar can be converted to right recursive and vice versa, so their languages will also be equivalent. Hence correct option is L(G3) = L(G4)
