Last 2 digits of my id: 24

Your target is to reach the goal node ' G ' from start node 'A' with the optimum cost. Simulate the following problem with A search algorithm and show the shortest path with the fringe for each iteration. Assume that states with earlier alphabetical order are expanded first. There are 6 nodes in the graph where the heuristic values of the 5 nodes are as follows. Here % refers to mod operation