1. Suppose that we modify A* in the following way: (a) we set g(n) = 0 and (b) we make h(n) = -d, where d is the depth of the search tree. ‘Assume that we are using A* to minimize the cost function. ‘What sort of search will this A* search emulate? DRS 2, Sometimes for a search problem there is no good evaluation function to compute a het score, but there is a good comparison method: a way to tell if one node is better than another, without being able to assign numerical values to either. Can we still perform best-first search using such a comparison method? Yes, ve can Know which node has the best heurfste score mm the gruune ; tarefore » we can apply beso frst Search If so, could the results we obtain differ from traditional best-first search? Bill be fhe same 3. Assuming we only have a comparison function, as in (2), could we perform At search? As, ome ne feed peed Lo know whch node tas peefer gun then) score aot pust better heurete If so, could the results we obtain differ fram traditional A* search? ¢627¢