The heuristic estimate of the distance to G are: h(A,2), h(B,3), h(C,4),h(D,3), h(E,2), h(F,1), h(G,0)

h(H,4), h(I,5), h(J,6),h(K,5), h(L,6), h(S,4)

Task:

a. Based on the Diagram above, DRAW a depth-first search tree and a breadth-first search tree.

b. For each search tree, state why using it may be good and why using it may be bad for the search.

PLEASE ANSWER QUESTION CORRECTLY SO I CAN GIVE UPVOTE!!