Consider the following road map with distances indicated on lines drawn between towns (the map is not to scale). The straight-line distances from each town to H are listed in the table. What is the order are nodes expanded by a depth-first search when searching for a (shortest) path between A and H ? Assume the successors of a state are returned in alphabetical order (i.e. the neighbouring nodes go into the stack or queue in alphabetical order), and that the search algorithm includes cycle checking along a path. ABCDFEGH ADH ABCDH ABFH