Consider the search problem shown in Figure 1 (Task 1). Draw the first four levels of the search tree starting from London (So root + 4 levels).(London to Kassel)? Also for the same search problem list all the nodes visited before you visit 5 unique cities (other than the start city) when you start search from Dresden using the following strategies

• breadth-first search.

Manchester 84 Birmingham 85 117 Luebeck Bristol London Hambury 63 1l 291 Bremen 132 153 Berlin Hannover 148 166 214 Magdeburg 165 Dortmund 125 Leipzig Duesseldorf Kassel 185 119 Dresden 350 / Frankfurt /263 222 22 Nuremberg Saarbruecken 171 207 143 _71 Karlsruhe Stuttgart 215 Munich