The time and space complexity of BFS is (For time and space complexity problems consider b as branching factor and d as depth of the search tree.)

A. Heuristic B. Critical C. Value based D. Analytical E. None of the above

A. Design B. Distribution C. project management D. field service E. None of the above

A. hierarchical planning B. non-hierarchical planning C. All of the above D. project planning E. None of the above

A. The Turing Test B. LISP C. The Logic Theorist D. Cybernetics E. None of the above