Homework 1 Use Breadth-first search and Uniform-cost search to find a path from Arad to Bucharest. Illustrate your search trees, until you find a solution (not necessary to be the optimal solution). You need to index the nodes you expended. Oradea 71 Neamt zerind 87 151 75 lasi Arad 140 92 Sibiu 99 Fagaras 118 Vaslui 80 Rimnicu Vilcea Timisoara 142 Pitesti 211 97 98 111 Lugoj 70 Mehadia 75 Dobreta 120 146 85 Hirsova 101 Urziceni 138 86 Bucharest 90 Craiova Eforie Giurgiu