Must be in JavaScript

1 Depth-First Search Recall the pseudocode for Depth-First Search: Given a graph and a node: . while unvisited nodes remain if current vertex v is the node we're looking for, return it mark v as visited for each edge (u, w) * recursively process w unless marked visited Implement the algorithm and test it on a few different graphs. You c choose any of the data structures we covered (adjacency matrix or adjacen list) for the implementation. The signature of the function should be function depthFirstSearch(graph, node); What is the worst-case big-e complexity of your implementation? Total 10 points