Perform A* search on this graph, and show your work by filling out the form below. Also write the shortest path to the nearest goal from the start node.

5 9 A: B, D: E: Priority Queue After Expanding Node ver. via n via Ni via n ht via n via nir, via nit, via nit, via n iti 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 " T 1 T " 1 T T 1 1 1 1 1 1 1 1 " 1 1 1 1 1 1 1 1 1 1 1 1 1 Route to goal