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.

Search order: $"$p$,$q$,$r$,$s$,$t$"$ and $"$p$,$q$,$s$,$t$,$r$"$ and $"$p$,$r$,$q$,$s$,$t$"$ indicate yes or no