Given a directed graph with

nodes: $\{p,q,r,s,t\}$

edges: $\{(p,q),(p,r),(q,s),(q,t),(s,t),(r,t)\}$

Indicate whether each of the following is a valid search from node p using the algorithm listed $($DFS$,$ BFS$,$ Topological Order$).$ Notice that no priority order is defined.

$\backslash$table$[[$SearchOrder$,$DFS from $p,,$BFS from $p,,$Topological sort,$],[p,q,r,s,t,[$ Select$],[$Select$],[$ Select $],[p,q,s,t,r,[$Select$],[$Select$],[$Select$],[p,r,q,s,t,,,[$Select$],[$Select$],$