10 12 6 10 Figure 1. Based on the tree given in Figure 1, complete the traversal nodes using Best First Search strategy. The start node is S and the destination node is K. (Note: Write the answer without dash (-), e.g. for A-5, just write A5. Put comma, for listing, e.g. A-5 and B-4, just write A5,B4, without blank spacing) Open = 1 ), Closed = 1 Open = Closed = [s], X = 5 Open = [A10,012), Closed = 1 1, x = B Open = ! Closed = [A,B,S), X = A Open = [L7,07,09,C12), Closed = 1 1, X = F Open = 1 1, Closed = [L,F,A,B,S], X = L Open = [K8,29,310,012), Closed = [ ),X =D Open = 1 1. Closed = [D,L,F,A,B,S], X = K, K is our GOAL then return the path (Use format A-B-C for the path) Path cost =