Write a program to execute a breadth$-$first search $($BFS$)$ and depth$-$first search $($DFS$),$ considering a starting point and a goal, e$.$g$.$ starting from the home page of a university, find the page of a particular person linked to it; or starting from a given location in a town, trace the path to a destination in the same town or another town. This program must clearly depict the start state, intermediate states and the goal test. Include the entire program code. Show demo snapshots of the program execution in terms of each node traversed, and the goal reached.

Turn$-$in: The program code and its demo snapshots