Consider the graph given below. What is the order in which the nodes mentioned in the options are to be traversed to find the shortest path from A to Z using best first search?

A. Node-A

B. Node-B

C. Node-C

D. Node-D

E. Node-E

Choose the correct answer from the options given below:

Using best first search, we always choose the next node with the minimum available cost.

From $A$:

$A \to C = 2$

$A \to F = 7$

So, choose $C$.

From $C$:

$C \to F = 3$

$C \to B = 10$

So, choose $F$.

From $F$:

$F \to D = 1$

$F \to E = 6$

So, choose $D$.

From $D$:

$D \to E = 2$

$D \to Z = 7$

So, choose $E$.

From $E$:

$E \to Z = 4$

Hence, the traversal order before reaching $Z$ is:

$A \to C \to F \to D \to E$

Correct option is:

$\boxed{(a)\ A \to C \to F \to D \to E}$