Answer all the questions and sub questions below. Make sure the answer is correct. Copying from other chegg answers is a thumbs down since they are wrong. Thank you, thumbs up for a good answer with organized explanation.

2. In the following search problem, the goal is to compute a path from S to G. (1). What is the value of the shortest path from each node to the goal node G Answer: (2). There are 6 edges in the graph. For each edge, if it is directed from node X to node Y, compute the difference h(x)h(Y) : Answer: (3). Is h(h) admissible? Yes / No