Implement DFS using the algorithm and apply it to the first 10 nodes of the Karate Network dataset.

a) Compute the node labelings in the order the nodes first placed into the stack.
b) Compute the node labelings in the order the nodes are last removed from the stack.
c) List all the discovery edges.
Record a Zoom video for going over your code with screenshare and with your webcam showing your face in the corner of the screen. (Need code with explanation)