Which of the following statements are correct?

Heuristics can often significantly reduce the search effort

Blind search always expands more nodes than heuristic search

A good heuristic should assign $\infty$ to unsolvable states

A safe heuristic is always goal aware

An admissible heuristic is always safe

The perfect heuristic can be computed efficiently for every search problem