Explain in no more than 20 words when two search algorithms can be called equivalent. From any of the search algorithms we have studied are any of them equivalent

If the cost of cheapest first (uniform cost first) search algorithm is set to a constant c = 1 for all edges will it be equivalent to breadth first search or depth first search? Give complete reasoning in less than 40 words.

In 1 line, give an example of a real-world problem in your surroundings in world which you think can be mapped to a classical search problem.

Also, state in 20 words how can the example above be mapped to classical search problem

Define a heuristic function for the problem you selected above and in 20 words define how it fulfils all the requirements of a good heuristic function.