Stuck need help!The class I'm taking is computer science discrete structures. Problem is attached. please view attachment before answering. Really struggling with this concept. Thank you so much. Below is a graph representing friendships between a group of students (each vertex is a student and each edge is a friendship). Is it possible for the students to sit around a round table in such a way that every student sits between two friends? What does this question have to do with paths?**Graph Explanation:**The graph is a complex network with multiple vertices and edges. Each vertex represents a student, and the edges indicate friendships between them. The graph has 10 vertices interconnected by numerous edges. The challenge is to arrange these students in a circular manner so that each student is flanked by friends, highlighting concepts related to paths in graph theory.

Actually, given question regarding graph..Please see the attached picture for Answer. ( I have only drawn the required edges)Each vertex is numbered with an integer. From the picture we can see that it is possible for the students to sit around a table such that every student sits b/w two friends. In terms of path this is equivalent finding the Hamiltonian path in the graph.