Consider a graph G in the following If you use a search tree for your answers, you will HAVE TO use the following one, which is rooted at a, and the goal is g. (a). (5 marks) Find a path from a to g in the graph G using the search strategy of depth-first search. Is the returned solution path an optimal one? Give your explanation and remarks on "why-optimal" or "why-non-optimal". (a). (5 marks) Find a path from a to g in the graph G using the search strategy of depth-first search. Is the returned solution path an optimal one? Give your explanation and remarks on "why-optimal" or "why-non-optimal". (b). (5 marks) Find a path from a to g in the graph G using the search strategy of breadth-first search. Is the returned solution path an optimal one? Give your explanation and remarks on "why-optimal" or "why-non-optimal". (c). (6 marks) Find a path from a to g in the graph G using the search strategy of leastcost first search. Is the returned solution path an optimal one? Give your explanation and remarks on "why-optimal" or "why-non-optimal". (d). (6 marks) Find a path from a to g in the graph G using the search strategy of best-first search. The heuristics for these nodes are: h(a,25);h(b,43);h(c,5);h(d,64); h(g,0). Is the returned solution path an optimal one? Give your explanation and remarks on "why-optimal or "why-non-optimal