Artificial Intelligence

QUESTION 4 Given the state-space graph below with initial state as A, indicate the order in which the nodes are expanded for a Uniform Cost algorithm to reach the Goal state G, and the cost value at Goal state G. For a tie-breaker between nodes with the same cost, expand the node with the lower alphabet first. B 6 8 D F ABCE G(14) ABDCEF G(8) ADF G(8) O ADCBEF G(10) O CBAAEF G(22)