In Uniform Cost Search $($UCS$),$ if there are two paths to the same node with different costs, which path will the algorithm choose?

Question $8$Answer

a$.$

The path with the highest path cost

b$.$

The path with the lowest path cost

c$.$

It depends on the implementation of the algorithm

d$.$

The path with the lowest heuristic value