As the average forward branching factor in a graph increases, what happens to the amount of wasted computation that occurs when using iterative deepening $($because of repeatedly generating the same nodes when searching to ever greater depths$)?$

Question $7$ options:

The amount of wasted computation goes down as the forward branching factor increases.

The amount of wasted computation stays roughly the same as the forward branching factor increases.

The amount of wasted computation goes up as the forward branching factor increases.