DFS_Pse_2 This question pertains to the use of the Graph Abstract Data Type (ADT) implemented using an adjacency map, as studied in our course. The algorithms DFS and BFS are used to explore graphs but follow different strategies for traversal. Below is a simplified pseudocode version of a Depth-First Search (DFS) algorithm that uses recursion and a discovereddictionary to track visited vertices: DFS(Graph G, Vertex u, Map discovered):    for each edge e incident to u in G:        let v be the vertex opposite u on edge e        if v is not in discovered:            discovered[v] ← e     // edge e discovered v            DFS(G, v, discovered) In the DFS pseudocode, what does the discovered[v] ← e assignment represent? Graph ADT For reference: class Vertex:    def __init__(self, x):        self._element = x class Edge:    def __init__(self, u, v, x):        self._origin = u        self._destination = v        self._element = x     def opposite(self, v):        return self._destination if v == self._origin else self._origin class Graph:    def __init__(self, directed=False):        self._outgoing = {}        self._incoming = {} if directed else self._outgoing     def incident_edges(self, v):        return self._outgoing[v].values()