If you have a consistent heuristic which of the following is correct?

Group of answer choices

You can use the graph search algorithm with a priority queue ordered by f$($n$)=$ g$($n$)+$h$($n$)$ as the first time generating that state is the shortest path to that state.

You can NOT use the graph search algorithm with a priority queue.

You can use the graph search algorithm with a priority queue ordered by f$($n$)=$ g$($n$)+$h$($n$)$ as all consistent heuristics are admissible.