Let's suppose we have the graph below with the following heuristic values: h(A) = 8 h(B) = 10 h(C) = 3 h(D) = 4 h(E) = 0

[answerhappygod]

Let S Suppose We Have The Graph Below With The Following Heuristic Values H A 8 H B 10 H C 3 H D 4 H E 0 1 (90.26 KiB) Viewed 26 times

Let's suppose we have the graph below with the following heuristic values: h(A) = 8 h(B) = 10 h(C) = 3 h(D) = 4 h(E) = 0 B 2 1 9 A 11 с 2 E 3 1 4 D We run A* on the graph above, starting at A and going to E. We break ties alphabetically. Q3.1 Intermediate steps 0.15 Points After visiting A, what is the correct state of our priority queue? O [A: O, B: 12, C: 14, D:7, E: 0] O [A: O, B: 2, C: 11, D: 3, E: 0] O [A: 0, B: 10, C: 3, D: 4, E: 0] O [B: 12, C: 14, D:7, E: 0] O [B: 2, C: 11, D:3, E: 0] O [B: 10, C3, D:4, E: 0] After visiting A, what is the correct state of our distTo array? O [A: 0, B: 12, C: 14, D:7, E: 0] O [A: 0, B: 2, C: 11, D:3, E: 0] O [A: O, B: 10, C3, D:4, E: 0] [A: 0, B: 00, C:00, D: 00, E: 0] O [A: 8, B: 0, C:00, D: 00, E: 0] What is the next node that gets visited after A? OB Ос OD OE Save Answer