Consider the following weighted, directed graph, representing the state space for a search problem. The weight between two nodes (u, v) indicates the cost of moving from node u to node v. The heuristic function value h(n) for each node n is also shown next to the node. The node S is the start state, and the node G is the goal state. h = 2 2 A 2 h = 3 h = 4 S 3 2. B 3 G) h = 0 h = 1 5 D 2 h = 2 Consider the following statement: 'The heuristic function his admissible' The statement is Select one: O True O False