Algorithm 2.3: Graph depth-first search with a stack. StackDFS (G, node) →visited Input: G = (V, E), a graph 1 2 3 4 5 6 7 8 9 10 11 12 node, the starting vertex in G Output: visited, an array of size |V| such that visited[i] is TRUE if we have visited node i, FALSE otherwise S CreateStack() visited CreateArray (IV) for i0 to V| do visited[i] ← FALSE Push (S, node) while not IsStackEmpty(S) do c← Pop (s) visited[c] ← TRUE foreach v in AdjacencyList (G, c) do if not visited[v] then Push (S, v) return visited

Note: java

Implement a Single linked list to store a set of Integer numbers (no duplicate) • Instance variable• Constructor• Accessor and Update methods 2.) Define SLinkedList Classa. Instance Variables:     # Node head     # Node tail     # int sizeb. Constructorc. Methods     # int getSize() //Return the number of nodes of the list.     # boolean isEmpty() //Return true if the list is empty, and false otherwise.     # int getFirst() //Return the value of the first node of the list.     # int getLast()/ /Return the value of the Last node of the list.     # Node getHead()/ /Return the head     # setHead(Node h)//Set the head     # Node getTail()/ /Return the tail     # setTail(Node t)//Set the tail     # addFirst(E e) //add a new element to the front of the list     # addLast(E e) // add new element to the end of the list     # E removeFirst()//Return the value of the first node of the list     # display()/ /print out values of all the nodes of the list     # Node search(E key)//check if a given…

vector<VertexT>  Vertices;  map<VertexT, vector<list>> adjList;   What is the worst case time complexity for this version of _LookupVertex?     bool _LookupVertex(VertexT v) const {      if (adjList.count(v) != 0) {          return true;      }      return false;  }   V is the number of total vertices in the graph, E is the average number of edges per vertex. O(v) O(VlogE) O(logV) O(V^2) O(E+V)