Consider a $5-$city problem: Let's call VIT University $($VU$)$ and the $5$ cities $($C$1),$

$($C$2),($C$3),($C$4)$ & $($C$5)$ respectively. A student starts from $($VU$),$ he$/$she visits $5$ cities, and

then returns back to $($VU$).$ Find the state$-$space representation of this problem. Also,

compare DFS & BFS approaches for the given problem.