iven a directed graph with des: \\( \\{p, q, r, s, t\\} \\) ges: \\( \\{(p, q),(p, r),(q, s),(q, t),(s, t),(r, t)\\} \\) dicate whether each of the following is a valid search from node \\( p \\) using the algorithm listed (DFS, BFS, Topologica der). Notice that no priority order is defined. stion 14 me the following code: parator \\( < \\) String \\( > \\) comparator \\( = \\) new Comparator \\( < \\) String \\( >()\\{ \\) lic int compare(String a, String b)\\{ eturn a.length()-b.length()