Last 2 digits of my id: 24

Your target is to reach the goal node ' G ' from initial node ' A ' with the optimal cost. Simulate the following problem with A search algorithm. Draw the search tree and determine the shortest path with fringe for each iteration. Assume that the states with earlier alphabetical order are to be expanded first. The heuristic values of the 6 nodes are as follows: Here \% refers to mod operation which finds the remainder. For example, if the last two digits of someone's ID is 12 then: \begin{tabular}{|l|} \hline h(A)=12%4+2=0+2=2 \\ \hline h(B)=12%5+3=2+3=5 \\ \hline h(C)=12%6+1=0+1=1 \\ \hline h(D)=12%5+2=2+2=4 \\ \hline h(E)=12%4+1=0+1=1 \\ \hline \end{tabular}