Recall that a dictionary, also known as a hashmap, works as follows: Inserting a key-value pair into a dictionary when the key is not already in the dictionary adds the pair to the dictionary: dict an empty dictionary dict"ke""value" print dic"key"] "value" Updating the value associated with a dictionary entry is done as follows: dictkey"]"new value" print dict "key" "new value We saw that for A graph search to be guaranteed to be optimal the heuristic needs to be con sistent. In this question we explore a new search procedure using a dictionary for the closed set