ajo-danza-colina-erizo routeyou update your notebook accordinglyas shown in table and figure $ $ $ $ $ $ $ $ $ figure following step in the shortest-path algorithm table step agents in ajobordodanzaand colina from ajo tobordo colina danza erizo step step step step (via ajo (via ajo) (via ajo) (via ajo)inf (via bordo (via danza (via danza) (via ajo (via ajo (via ajo) (via ajo)inf inf (via danza (via colinathe last agentin erizo the cheapest path from ajo to any town you know about that doesn' have an agent is now $ to erizovia danza and colina you dispatch an agent to erizobut she reports that there are no routes from erizo to towns without agents (there' route to bordobut bordo has an agent table shows the final line in your notebookall you've done is add star to the erizo entry to show that an agent is there table step agents in ajobordodanzacolinaand erizo from ajo tobordo colina danza erizo step step step step step (via ajo (via ajo) (via ajo) (via ajo) (via ajo)inf (via bordo (via danza (via danza) (via danza) (via ajo (via ajo (via ajo) (via ajo) (via ajo)inf inf (via danza (via colina (via colina)