Suppose we have a problem space where there is a uniform branching factor b and there is a single goal node at depth m. What is the minimum number of nodes expanded and the storage needed for BFS and DFS? (Hint: this question asks about the best case performance of BFS and DFS).