Which of the following pairs of graphs are isomorphic? Explain carefully. (a) (b) AA A京 5 3 6' '4

For the following simple graphs G1​=(V1​,E1​) and G2​=(V2​,E2​) (described by their vertex and edge sets) decide whether they are isomorphic. If they are then prove it, and if they are not give a convincing argument that explains why not. V1​={a,b,c,d,e}, E1​={ab,ad,ce,cd,cb,bd,be}, V2​={1,2,3,4,5}, E2​={12,14,15,24,34,35,45}

determine whether the given pair of graphs is isomorphic. Exhibit an isomorphism or provide a rigorous argument that none exists. Make sure to show what u1 maps to what v, what u2 maps to what v, etc.

please explain fully

Answer the given question with a proper explanation and step-by-step solution.  Answer yes or no and Prove or explain precisely why please1. If you can solve TSP in linear time, you can solve the Hamiltonian path problemin linear time.2. If Graph Isomorphism belongs to NPC then P = NP3. The question if a program stops on an input x within n^3 steps or less belongs toNPC.4. The question does a program stops on an input x (namely there is no infiniteloop) belongs to NPC.

a) For the first image (pentagon graph) can you show how the graphs are isomorphic aand also label the verticies b) For the second image (square graph) can you explain why the graphs are no isomorphic

Could you also do question one please