Which search strategy guarntees finding the least-cost solution?Bredth-first searchDepth-first searchUniform-cost search

The search strategy that guarantees finding the least-cost solution is Uniform-cost search.

Here's why:

1. Breadth-first search: This strategy starts at the tree root and explores all the neighboring nodes at the present depth prior to moving on to nodes at the next depth level. It doesn't take into account the path cost, so it doesn't guarantee the least-cost solution.

2. Depth-first search: This strategy starts at the root and explores as far as possible along each branch before backtracking. Like breadth-first, it doesn't consider the path cost, so it doesn't guarantee the least-cost solution either.

3. Uniform-cost search: This strategy explores the node with the lowest path cost first. Therefore, it always expands the least-cost unexpanded node. It continues the process until the goal has been reached. Hence, it guarantees finding the least-cost solution.