We have learned the following three search strategies $($using alphabetic order to break ties$)$: $(1)$ Breadth$-$First Search $($BFS$),(2)$ Uniform Cost Search, and $(3)$ Depth$-$First Search $($DFS$)$ to explore the road graph given in the following $$gure$.$ We are traveling from Westhampton to Florence. Show your work using DFS$,$ BFS$,$ and UCS for the route planning.