Please the code should require user inputs and screenshot of the running program

1[25 Points] Adjacency List Given the Adjacency List of an undirected graph, write a C++ program to determine the following. a) If the graph has self-loops b) If the graph is completely connected c) If the graph has an isolated vertex Print suitable messages. Ex. The graph has no self-loops; The graph has self-loops at vertices A, D; The graph is not completely connected; The graph has no isolated vertex; The vertex C' in the graph is isolated; etc