Q3/The search algorithm A* does not terminate until a goal node is removed from the OPEN list. That goal state may have been in the OPEN list for thousands of node expansions, which seems inefficient. Why not terminate A* as soon as a goal node is dded to OPEN? Justify your answer with a simple, concrete example that shows doing so would violate an important property A*. Be sure to explain your answer.

Q3/The search algorithm A* does not terminate until a goal node is removed from the OPEN list. That goal state may have been in the OPEN list for thousands of node expansions, which seems inefficient. Why not terminate A* as soon as a goal node is dded to OPEN? Justify your answer with a simple, concrete example that shows doing so would violate an important property A*. Be sure to explain your answer.