Question

is there a search problem in which breadth first search is guranteed to reach the goal while uniform cost search fails?if yes explain,if no justify it

Answer 1

Answer:

jdjdjejdjfhhfhfhfhsjehhndnnfnfhfrknrnddhhsgd in

Explanation:

hhjtuiiikqkjdufuckcidjdukdkdkkdkdkdkfodosleosoididk

$118611 {yy5}^{2}$