Graph Algorithms UGC

Question 1

Consider the following terminology and match List 1 and List 2 and choose the correct answer from the code given below b= branch factor d= depth of shallowest solution M= Maximum depth of the search tree I= depth limit

• (a)-(iii), (b)-(ii), (c)-(iv), (d)-(i)
• (a)-(ii), (b)-(iii), (c)-(iv), (d)-(i)
• (a)-(i), (b)-(ii), (c)-(iv), (d)-(iii)
• (a)-(i), (b)-(iii), (c)-(iv), (d)-(ii)