Hi i am taking a A.I class and i am stuck on this question

Consider the following graph with the edge cost representing the action cost from a pair of adjacent states, using A to search a path from S to G. We assume the heuristic function (h) value as follows: h(S)=5,h(A)=4,h(B)=3,h(C)=2,h(D)=4,h(E)=2,h(F)=1,h(H)=2, h(G)=0, you are asked to show step by step (f-value, g-value, and h-value, etc.) how A algorithm works. We assume the A won't expand the same state more than once. Alphabetic order is used to break the tie (A before B, B before C, and so on). At the end, please explicitly show the resulting path from S to G and the search tree generated