When we talked about implementing DFS for a directed graph instead of an undirected, the only change in the course came from replacing "Digraph" with "Graph" to use the correct API. The logic and methods for the algorithm remained the same. Why is this? DFS uses recursion instead of a Stack ADT object so the implementation doesn't need to change.O DFS is a layer of abstraction beneath a graph ADT, so the graph depends on DFS$,$ not the otherway around. DFS defers to the graph ADT to determine which nodes count as adjacent.O DFS is just a special case $-$ BFS would require rewriting the graph algorithm from scratch for digraphs.