consider two admissible heuristic functions: h₁(n) and h₂(n) for a search problem. suppose now we define two new heuristic functions: h₃(n)=(h₁(n)+h₂(n))/2 and h4(n)=h1(n) h2(n) .
A. Is h₃ always admissible? Explain
B. Is h₄ always admissible? Explain
C. For each of the admissible function above, compare their dominance with respect h₁ and h₂. For this question, you can assume that h₂(n)≥h₁(n)for all n
