Q6. Suppose we want to travel from Arad to Bucharest in the following graph. Figure 3.2 A simplified road map of part of Romania. (i) If we did a Breadth First Search starting from Arad, what sequence of places would we visit before reaching Bucharest? Drawing the tree is required. (15 points) (ii) If we did a Depth First Search starting from Arad, what sequence of places would we visit before reaching Bucharest? Use the tree that you constructed for the solution to (i) above. Do not construct a new tree. (15 points) (iii) If we did an A Search starting from Arad, what sequence of places would we visit before reaching Bucharest? The straight line distance of each place to Bucharest is given below. Construct a new tree if needed. In that case, drawing the tree is required. (20 points)