I need help with this problem please and please make it legible I… I need help with this problem please and please make it legible I can’t read handwriting.section*{Problem 1}For parts (a) and (b), indicate if each of the two graphs are equal. Justify your answer.?egin{enumerate}[label=(alph*)]?item?fbox{includegraphics[width=1.5in]{M6-fig1}}hfil?box{includegraphics[width=1.5in]{M6-fig2}}\\?color{blue}{bf Figure 1:} emph{Left: An undirected graph has 5 vertices. The vertices are arranged in the form of an inverted pentagon. From the top left vertex, moving clockwise, the vertices are labeled: a, b, c, d, and e. Undirected edges, line segments, are between the following vertices: a and b; a and c; b and c; c and d; e and d; and e and c. ??{color{blue}{bf Figure 2:} emph{?ight: The adjacency list representation of a graph. The list shows all the vertices, a through e, in a column from top to bottom. The adjacent vertices for each vertex in the column are placed in a row to the right of the corresponding vertex’s cell in the column. An arrow points from each cell in the column to its corresponding row on the right. Data from the list, as follows: Vertex a is adjacent to vertices b and c. Vertex b is adjacent to vertices a and c. Vertex c is adjacent to vertices a, b, d, and e. Vertex d is adjacent to vertices c and e. Vertex e is adjacent to vertices c and d.}}\%Enter your answer below this comment line.newpage?tem?box{?includegraphics[width=1.5in]{M6-fig3}}hfil?box{$left( begin{array}{ccccc}0 & 0 & 1 & 1 & 0 & 0 & 0 & 0 & 11 & 0 & 0 & 1 & 01 & 0 & 1 & 0 & 1 & 1 & 0 & 1 & 0end{array} right)$}\\?{color{blue}{bf Figure 3:} emph{An undirected graph has 5 vertices. The vertices are arranged in the form of an inverted pentagon. Moving clockwise from the top left vertex a, the other vertices are, b, c, d, and e. Undirected edges, line segments, are between the following vertices: a and c; a and d; d and c; and e and b.?\}}%Enter your answer below this comment line.?ewpage?————————————————————————————————–item Prove that the two graphs below are isomorphic.\?fbox{includegraphics[width=2in]{M6-fig4}}\?color{blue}{bf Figure 4:} emph{Two undirected graphs. Each graph has 6 vertices. The vertices in the first graph are arranged in two rows and 3 columns. From left to right, the vertices in the top row are 1, 2, and 3. From left to right, the vertices in the bottom row are 6, 5, and 4. Undirected edges, line segments, are between the following vertices: 1 and 2; 2 and 3; 1 and 5; 2 and 5; 5 and 3; 2 and 4; 3 and 6; 6 and 5; and 5 and 4. The vertices in the second graph are a through f. Vertices d, a, and c, are vertically inline. Vertices e, f, and b, are horizontally to the right of vertices d, a, and c, respectively. Undirected edges, line segments, are between the following vertices: a and d; a and c; a and e; a and b; d and b; a and f; e and f; c and f; and b and f.}}\%Enter your answer below this comment line.\item Show that the pair of graphs are not isomorphic by showing that there is a property that is preserved under isomorphism which one graph has and the other does not.fbox{includegraphics[width=2in]{M6-fig5}}\{color{blue}{bf Figure 5:} emph{Two undirected graphs. The first graph has 5 vertices, in the form of a regular pentagon. From the top vertex, moving clockwise, the vertices are labeled: 1, 2, 3, 4, and 5. Undirected edges, line segments, are between the following vertices: 1 and 2; 2 and 3; 3 and 4; 4 and 5; and 5 and 1. The second graph has 4 vertices, a through d. Vertices d and c are horizontally inline, where vertex d is to the left of vertex c. Vertex a is above and between vertices d and c. vertex b is to the right and below vertex a, but above the other two vertices. Undirected edges, line segments, are between the following vertices: a and b; b and c; a and d; d and c; d and b.}}\%Enter your answer below this comment line.\end{enumerate}???newpage?————————————————————————————————–Image transcription textFor parts (a) and (13-), indicate if eachof the two graphs are equal. Justify youranswer. … Show moreImage transcription textb C 0 01 0 (b) 1 1 0… Show moreImage transcription text(c) Prove that the two graphs below areisomorphic…. Show moreImage transcription text(d) Show that the pair of graphs are notisomorphic by showing that there is aproperty that is preserved… Show more… Show moreEngineering & TechnologyComputer ScienceMAT 230
