Pick a Node! Suppose that the following nodes appear in the frontier of a search tree. According to the selected algorithm, which node will be selected next and removed from the frontier? For ties, assume the node appearing topmost in the list will be chosen.
The underlying idea is that each algorithm uses a particular attribute of the nodes to determine which to select. E.g., for Uniform Cost Search (UCS), it's the path-cost. UCS will always select the node with the least path-cost.
| Algorithm: | |
| Your Answer: |