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. O b. O C. I and II I, II, III and IV II and III O d. II, III and IV Supposed, you are given: T(obama) and VxT(x) Q(x) However, you notice that you cannot apply modus ponens because T(x) and T(obama) do not match. Therefore, suggest the CORRECT solution to solve the problem. O A. Resolution refutation OB. First order logic O C. Substitution and unification O D. Quantifier duality