$\backslash$table$[[h(G),h(B),h(A),],[0,1,4,$I$],[0,4,5,$II$],[0,3,4,$III$],[0,2,5,$IV$]]$

For the following questions, consider the search problem shown above. It has only three states, and three directed edges. A is the start node and G is the goal node.

In the table, there are four different heuristic functions numbered from I through IV$.$

Fill the following table

$\backslash$table$[[?$Consistent $($monotonic$),?$Admissible,heuristic function$],[NoYes,NoYes,.],[NoYes,NoYes,.11],[$No Yes$,NoYes,.$III$],[$Noi $,$ Yes $,$No$$ Yes $,.$IV$]]$