If we use the graph search A$*$ algorithm, i$.$e$.,$ we expand each node exactly once, which of the following is true

Group of answer choices

The algorithm is guaranteed to find the optimal solution if the heuristic is both admissible and consistent

The algorithm is guaranteed to find the optimal solution if the heuristic is admissible but not consistent

The algorithm is guaranteed to find the optimal solution if the heuristic is not admissible but consistent

The algorithm can never be guaranteed to find the optimal solution