The state space diagram below has H as the start node and G as the goal node. Compute the path $($from start node to goal node$)$ and give the list of generated nodes in order using Depth First Search $($DFS$)$ and Greedy Best First Search. Assume edge weight to be $1$ for DFS$.$ The values inside the node represent the estimates of the cost from that node to the goal node. Write down all the steps involved in arriving at the final solution using DFS and Greedy Best First Search.