| Decide whether the following statements are true or false. If true, explain why. If false, give a contradicting example. Recall that b is the average branching factor and, d is the depth of the solution (path to the goal), and m the maximum length of the search space. a. A" search always expands fewer nodes than DFS does. b. For any search space, there is always an admissible and consistent A* heuristic. c The space complexity of breadth first search is b d. Uniform Cost Search is Complete and optimal e. Ifh is consistent heuristic then it is also an admissible heuristic