COMPUTER SCIENCE MCQS: If b is the branching factor and m is the maximum depth of the search tree, what is the space complexity of greedy search ? [N17P3Q56]