5. Select all true statements about DFS and BFS in the box below. Assume no other algorithms are involved: for example, DFS can explore a tree means DFS can achieve it alone without involving with any other algorithms. (1 point) A. When exploring a wide and shallow tree, DFS is more memory efficient than BFS. B. DFS can find words with increasing order of length in auto-completion. C. BFS can find all the vertices that are reachable from a given vertex, but DFS can not. D. Both DFS and BFS can be used to detect cycles in a graph. E. DFS is generally faster than BFS when exploring a graph./