Starting at the root node A, give the sequence according to which the nodes will be explored by the different search strategies below.

Upon exploring a node, all of its children will be discovered and added to the end of the fringe list. Take into account that ties are resolved by

considering first those nodes that were discovered earlier than others, and if there is still ambiguity, by going from left to right within a level.

i) Breadth-First search.

ii) Uniform-Cost Search.

a) Consider the following search tree. It contains information about states (the nodes), paths between states (the edges) and path cost (the numbers)