Using Uniform Cost Search algorithm, find the solution for going from A to G$.$

a$)$ What is the solution path? $($Enter the path in the $"$X$,$ Y$,...$ Z$"$ format$)$

b$)$ What the path cost? $($Enter the number only$)$

c$)$ Is it optimal? $($Yes$/$No$)$