Consider a best$-$first search $($BFS$)$ algorithm that tries to find the optimal goal state with minimal cost. Consider heuristics subscript $1$h$1,$ subscript $2$h$2$ with subscript $1$ not stretchy left parenthesis not stretchy right parenthesis less or equal than subscript $2$ not stretchy left parenthesis not stretchy right parenthesish$1($n$)$h$2($n$)$ for all states n$.$ BFS with subscript $1$h$1$ is guaranteed to expand fewer nodes or an equal number of nodes to arrive at the optimal goal state than BFS with subscript $2$h$2$

Select one:

True

False