Consider the search graph below. The h value of a node is given adjacent to that node. The actual cost of traversing an arc is given adjacent to that arc. Node A is the start/initial state. Nodes F, K, and L are goals. Leaf states/nodes have no successors.
Give the order in which nodes are visited (i.e., checked for goalness) by each of the following search strategies. In the case of two or more nodes with the same evaluation score on the frontier, break the tie by visiting the nodes from left-to-right as the nodes appear in the graph above. Also answer the admissibility question. Submit all answers (clearly labeled a-f, and with the name of the search strategy) as a PDF file on Brightspace in the A-w2 submission folder.
a) Lowest-Cost-First Search:
b) Heuristic Depth-First Search:
c) Greedy Best-First Search:
d) A*:
e) Is the heuristic admissible?