In Lowest$-$Cost$-$First search what is the search strategy?

Group of answer choices

Treat the frontier as a priority queue where the paths are ordered by length.

Treat the frontier as a priority queue where the paths are ordered by a heuristic function h$().$

Treat the frontier as a priority queue where the paths are ordered by cost$.$

Treat the frontier as a priority queue where the paths are randomly ordered.