You are given the above unweighted graph and want to find the shortest path from node A to node P using A* Search. Your algorithm has the following properties:
- It uses Manhattan distance as its heuristic (the h-value).
- If two nodes look equally good, it breaks ties by selecting the node with a smaller heuristic (or, equivalently, the node with the largest distance traveled).
- If two nodes are still tied, it breaks ties by choosing the node which comes first alphabetically.
For each of the nodes, specify the g-value and h-value when they are discovered. Then, specify the order in which nodes are explored, stopping once P is explored.