Questions 89 Refer Following Search Graph 8start 80 80 Questions 8 9 Refer Following Searc Q43884183
Questions 89 refer to the following search graph with 8start = 80. 80 Questions 8-9 refer to the following search graph with Start = 8o. Quick BFS 80 Quick Dr Quick DFS 84 85 86 84 85 86 88 89 88 89 8. Suppose the goal is to find a path to 88. Is it the case that a depth- first strategy is guaranteed to return the shortest path? Explain your answer. DFS Exp. Path Frontier 8. Suppose the goal is to find a path to 8g. Is it the case that a depth- first strategy is guaranteed to return the shortest path? Explain your answer. BFS Exp. Path Frontier {S} 10->s {SOS1, SOS2, SOS3} 1 –> SOS1 {SOS2, SOS3, SOS154, SOS155) 2 –> SOS154 {SOS2, SOS3, SOS155) 3 –> SOS155 {SOS2, SOS3} 4 –> SOS2 {SOS3, SOS255, SOS2S6, SOS258) 5 –> SOS255 {SOS3, SOS2S6, SOS258} 6–> SOS256 {SOS3, SOS258) 7 –> SOS258 (GOAL) {SOS3} 0 –>S 1–> SOS1 2 –> SOS2 3 –> SOS3 4 –> SOS1S4 5-> SOS155 6–> SOS256 7 –> SOS2S8 (GOAL) TERMINATE {SOS1, SOS2, SOS3} {SOS2, SOS3, SOS1S4, SOS155) {SOS3, SOS1S4, SOS1S5, SOS2SS, SOS2S6, SOS258) {SOS154, SOS155, SOS255, SOS256, SOS258) {SOS1S5, SOS255, SOS2S6, SOS258} {SOS2S6, SOS258} {SOS258} Ø} TERMINATE Answer: it is not the case the DFS returns the shortest path. As we see here, both DFS and BFS have found the goal after going through 7 paths. This means that we cannot guarantee that DFS is faster in this particular case. (is my answer and expansion right?) Show transcribed image text Questions 89 refer to the following search graph with 8start = 80. 80 Questions 8-9 refer to the following search graph with Start = 8o. Quick BFS 80 Quick Dr Quick DFS 84 85 86 84 85 86 88 89 88 89 8. Suppose the goal is to find a path to 88. Is it the case that a depth- first strategy is guaranteed to return the shortest path? Explain your answer. DFS Exp. Path Frontier 8. Suppose the goal is to find a path to 8g. Is it the case that a depth- first strategy is guaranteed to return the shortest path? Explain your answer. BFS Exp. Path Frontier {S} 10->s {SOS1, SOS2, SOS3} 1 –> SOS1 {SOS2, SOS3, SOS154, SOS155) 2 –> SOS154 {SOS2, SOS3, SOS155) 3 –> SOS155 {SOS2, SOS3} 4 –> SOS2 {SOS3, SOS255, SOS2S6, SOS258) 5 –> SOS255 {SOS3, SOS2S6, SOS258} 6–> SOS256 {SOS3, SOS258) 7 –> SOS258 (GOAL) {SOS3} 0 –>S 1–> SOS1 2 –> SOS2 3 –> SOS3 4 –> SOS1S4 5-> SOS155 6–> SOS256 7 –> SOS2S8 (GOAL) TERMINATE {SOS1, SOS2, SOS3} {SOS2, SOS3, SOS1S4, SOS155) {SOS3, SOS1S4, SOS1S5, SOS2SS, SOS2S6, SOS258) {SOS154, SOS155, SOS255, SOS256, SOS258) {SOS1S5, SOS255, SOS2S6, SOS258} {SOS2S6, SOS258} {SOS258} Ø} TERMINATE Answer: it is not the case the DFS returns the shortest path. As we see here, both DFS and BFS have found the goal after going through 7 paths. This means that we cannot guarantee that DFS is faster in this particular case. (is my answer and expansion right?)
Expert Answer
Answer to Questions 89 refer to the following search graph with 8start = 80. 80 Questions 8-9 refer to the following search graph …
OR