CO$1$

a$.$ Determine a new heuristic $h_2(n)$ which is dominant to the given heuristic and also

consistent.

b$.$ Perform A$*$ search on the $h_1(n)$ heuristic considering $A$ as the start node alongside $G$

as the goal node and comment if the optimal path is returned. Push Nodes

alphabetically and in case of a tie during expansion, use FIFO approach.

c$.$ Comment on the consistency of $F$ and A for $h_1(n)$