Much help will be appreciated!

Consider the graph shown below. Assume you start at Arad and want to go to either Dobreta or Urziceni. Show step-by-step how you would solve this with a breadth first graph search. When adding to the breadth first search queue, do it in lexicographical order (i.e. If you were starting at Iasi you would first add Neamt then Vaslui as N is before V in the alphabet). At each step show: (1) the "fringe" nodes (the queue) (2) the explored nodes (stuff that has left the queue) (3) which node you are taking next from the fringe set to move to the explored set Oradea 71 Neamt Zerind 87 151 75 lasi Arad - 140 92 Sibiu 99 Fagaras 118 Vaslui 80 Rimnicu Vilcea Timisoara 142 Lugoj Pitesti 211 97 701 Mehadia 146 101 Hirsova 86 138 75 Dobreta 98 85 Urziceni Bucharest 90 Giurgiu 120 Craiova Eforio Consider the graph shown below. Assume you start at Arad and want to go to either Dobreta or Urziceni. Show step-by-step how you would solve this with a breadth first graph search. When adding to the breadth first search queue, do it in lexicographical order (i.e. If you were starting at Iasi you would first add Neamt then Vaslui as N is before V in the alphabet). At each step show: (1) the "fringe" nodes (the queue) (2) the explored nodes (stuff that has left the queue) (3) which node you are taking next from the fringe set to move to the explored set Oradea 71 Neamt Zerind 87 151 75 lasi Arad - 140 92 Sibiu 99 Fagaras 118 Vaslui 80 Rimnicu Vilcea Timisoara 142 Lugoj Pitesti 211 97 701 Mehadia 146 101 Hirsova 86 138 75 Dobreta 98 85 Urziceni Bucharest 90 Giurgiu 120 Craiova Eforio