Which of the statements below is incorrect? In terms of running time, O DFS is quicker than BFS. O The performance of both DFS and BFS is determined by the graph implementation. O DFS makes use of a...

Which of the statements below is incorrect? In terms of running time, O DFS is quicker than BFS. O The performance of both DFS and BFS is determined by the graph implementation. O DFS makes use of a stack, while BFS makes use of a queue. BFS and DFS may both be used to assess a graph's connectedness and acyclicity.