The problem of equivalence of a CFG and a RG?
There is no algorithm which can determine for any context-free grammar $G_1$ and regular grammar $G_2$ whether $L(G_1) = L(G_2)$.

However, it may well be possible to determine for particular $G_1$ and $G_2$, using heuristic proof techniques (aka human intuition).

Good luck with the assignment.