Consider the following graph, where S is the start state and G is the goal. The arrows in black indicate the actual cost of getting from one state to the next while the arrows in red indicate the optimum estimated cost of getting from a state to the next. I just would like to understand how I would answer this question.

Apply the A$*$ algorithm for the following $2$ cases. Recall that the value at a node N is calculated as f$($N$)=$ g $+$ h$*.$

Case $1$ :Overestimation by the algorithm

h$*($from A to G$)=80$

h$*($from B to G$)=70$

Case $2$: Underestimation by the algorithm

h$*($from A to G$)=30$

h$*($from B to G$)=20$

Discuss the solutions obtained in both cases. What is your conclusion?