i need an answer in half anhour Which of the following is TRUE about breadth-first search (BFS)?

i need an answer in half anhour

Transcribed Image Text:

Which of the following is TRUE about breadth-first search (BFS)? 1. BFS requires comparatively less memory to Depth First Search. II. The time complexity of BFS is O(b d+1) where b is branching factor and d is depth of the tree. III. BFS is better when the goal is closer to the starting node. IV. There is no guarantee of finding the goal node. The states may also enter into infinite loops. O a. II and III O b. O c. II, III and IV O d. I and II I, II, III and IV Let y: The weather is hot z: The weather is cold The correct logic for the statement: "The weather is neither hot nor cold." is a. y Az O b. yVZ O c. ¬у ^ ¬Z O d. ¬y v ¬Z Which of the following is TRUE about breadth-first search (BFS)? 1. BFS requires comparatively less memory to Depth First Search. II. The time complexity of BFS is O(b d+1) where b is branching factor and d is depth of the tree. III. BFS is better when the goal is closer to the starting node. IV. There is no guarantee of finding the goal node. The states may also enter into infinite loops. O a. II and III O b. O c. II, III and IV O d. I and II I, II, III and IV Let y: The weather is hot z: The weather is cold The correct logic for the statement: "The weather is neither hot nor cold." is a. y Az O b. yVZ O c. ¬у ^ ¬Z O d. ¬y v ¬Z