We have examined various search algorithms, some uninformed, some informed. We saw a few that use a Priority Queue, with the primary difference in the priorities given to states as they were added to the priority queue. Consider an algorithm for which the priority of a state n is given by: Assume that h(n) is an admissible heuristic. g(n) is the cost along the current path of getting to state n from the start. w is a real-valued parameter Answer the following questions: a. For what range of values of w is this algorithm guaranteed to be optimal? Hint: answer b, c, and d first. Your answer to those parts, if correct, will help you answer part a. b. If w 0, then what search algorithm is this equivalent to in terms of order that states will be expanded? c. If w 1, then what search algorithm is this equivalent to? If w 2, then what search algorithm is this equivalent to in terms of order that states will be expanded