Find the degree of each vertex in the graph. F A H C D G B "E Complete the following table. Vertex A B C D E F G H Degree of Vertex (Type whole numbers.)In the graph to the right, which vertex(vertices) is(are) adjacent to vertex A? A H C D G B E Choose the correct answer below. O A. C and B O B. D, G, and I O C. G and I O D. A, B, C, and D OE. G OF. A and C O G. E and G OH. F and H OL. D O J. C, E, and FWatch the video and then solve the problem given below. A A Click here to watch the video. Are the two graphs equivalent? D B C B C Choose the correct answer below. O A. Yes, the graphs are equivalent. They have the same number of vertices connected to each other in the same way. O B. No, the graphs are not equivalent. Their edges are connected in different ways. O C. Yes, the graphs are equivalent. Although their edges are connected in different ways, they have the same number of vertices. O D. No, the graphs are not equivalent. One has a triangular shape and the other has a rectangular shape.A connected graph has 20 even vertices and no odd vertices. Determine whether the graph has an Euler path (but not an Euler circuit), an Euler circuit, or neither an Euler path nor an Euler circuit, and explain why The described graph has O an Euler circuit. O neither an Euler path nor an Euler circuit. O an Euler path (but not an Euler circuit)