$[5$ pts$.]$ Consider the following pseudocode for an operation on a digraph ADT $G$ implemented using the adjacency list structure.Fill in the following table with the operation being performed $($a brief description in a few words$)$ and tight big$-$Oh characterizations of the worst$-$case asymptotic running time and space complexity of the algorithm described in the pseudocode above for the operation as a function of the number of vertices n and$/$or the number of edges m$.$ Assume that both the queue and stack ADTs are implemented using a doubly$-$linked list data structure with direct access $($pointers$)$ to the front and back of the list. Also asssume that all map operations take constant time and space.

$\backslash$table$[[$OpERATION$,$Time,Space$],[,,]]$