Assuming B=10 and D =5 calculate the following using both illustrations and explanation based on the description provided below

N(IDS) =

N(BFS) =

In an iterative deepening search, the nodes on the bottom level (depth d) are generated once, those on the next-to-bottom level are generated twice, and so on, up to the children of the root, which are generated d times. Therefore, the total number of nodes generated in the worst case is N(IDS)-(d)b(d -1)b 2+1)b d which gives a time complexity of O (b d)