Last 2 digits of my id: 24

Your target is to reach the goal node ' z ' from start node ' a ' with the most optimum cost. Simulate the following problem with A algorithm, draw the search tree and determine the shortest path with fringe for each iteration. Assume that states with earlier alphabetical order are expanded first. The heuristic values of the 6 nodes are as follows: Here \% refers to mod operation. For example, if the last two digits of someone's id is 16 then \begin{tabular}{|l|} \hline h(a)=16%3+3=4 \\ \hline h(b)=16%6+2=6 \\ \hline h(c)=16%4+2=2 \\ \hline h(d)=16%2+3=3 \\ \hline h(e)=16%5+1=2 \\ \hline h(z)=0 \\ \hline \end{tabular}