Assume that you have two heuristic functions for a specific problem h, h. Provide formal arguments to answer the following questions. a. If you use the minimum value of hi(n) and h(n) at every state, will the resulting heuristic be admissible? Is it a consistent one? b. If you use the maximum value of hi(n) and h(n) at every state, will the resulting heuristic be admissible? Is it a consistent one? c. If you define the heuristic function h3(n) = w-h(n) + (1-w) h(n), where 0 w 1, will this be admissible? Will it be consistent? d. Consider an informed, best-first search algorithm in which the objective function is f(n) = (2-w) g(n) +w.h(n). For what values of w is this algorithm guaranteed to be optimal when h is admissible (for the case of TREE-SEARCH)? What kind of search does the resulting algorithm perform when w=0? When w=1? When w = 2?