Solve the following graph for initial state "S" to goal state "G".Give all intermediate steps using a)hill climbing and b)steep hill climbing.

Evaluate nodes in alphabetical order for same heuristic values.

SG uestion 2 For each of the following graphs/trees, use the following search strategies to show the states visited, along with the open and closed lists at each step (where it applies). The value on each node reflects a heuristic, while the edges are given cost values. You are required to explore the graph/tree starting from node S until the goal node G is explored or until no more nodes can be visited. Nodes of equal importance should be explored in an alphabetical order (whenever the order is not specified by the algorithm itself, use alphabetical order)