Which of the following statements about iterative deepening is INCORRECT?

It has roughly the same time complexity as Breadth$-$First Search, especially if the branching factor is high

Every iteration of the search reuses the results of previous iterations for greater efficiency

It is both optimal and complete in the same conditions where Breadth$-$First Search would be optimal and complete

Deeper nodes in the search tree are visited FEWER times than shallow nodes