We say that two graphs G = (VG,EG) and H = (VH,EH) are isomorphic if the opposite projection f : VG ) VH i.e. {u,v} 5 EG i.e. mu), f(v)} e EH. Is it possible to create two graphs that are not isomorphic but have the same number of nodes, the same number edges and the same degree nodes? Justify why the graphs are or are not isomorphic