We discussed in class that the worst$-$case computational complexity for UCS is O$($b$^$d$)$ where b is the

branching factor and d $($assuming to be a finite number$)$ is the depth of the search tree $($note that this

notation differs slightly from that on the slides$).$ Show that the worst$-$case computational complexity for

iterative deepening search $($IDS$)$ is not much worse.