Clearly, the question is wrong.
a) G2 has the highest degree 5 and G3 has the highest degree 4. so we can conclude that it's not isomorphic
b)In G1 and G2, the degree of a node with self-loop is different in both graphs, so can't compare.
c) and d) can be discarded directly as none of these is simple graph due to parallel edges.