Using the graph above $($GREEDY SEARCH ALG, A$*$ ALG$)$

A$)$ Solve using greedy search starting at Node $S$ and ending at Node $G$

B$)$ Solve using $A^{*}$ search starting at Node $S$ and ending at Node $G$

C$)$ What is the optimal path starting at Node $S$ and ending at Node $G?$

D$)$ Does $A^{*}$ locate the optimal path starting at Node $S$ and ending at Node $G?$

Why or why not?