Match List I with List II. List I: (a) Greedy best-first, (b) Lowest cost-first, (c) A* algorithm. List II: (i) Minimal cost(p) + h(p), (ii) Minimal h(p), (iii) Minimal cost(p).

1. A(a)-(i); (b)-(ii); (c)-(iii)
2. B(a)-(iii); (b)-(ii); (c)-(i)
3. C(a)-(i); (b)-(iii); (c)-(ii)
4. D(a)-(ii); (b)-(iii); (c)-(i)

Pick an option to check yourself, or open the answer below.

Show answer & explanation

Correct answer: D. (a)-(ii); (b)-(iii); (c)-(i)

Explanation

Greedy best-first picks minimal h; lowest-cost-first picks minimal path cost; A* picks minimal cost + h.