In a hi$-$tech city, a robot is tasked with delivering an important package to the central hub. However, it finds itself lost in a sprawling maze filled with obstacles $($walls$).$ The goal is to navigate through the maze and reach the delivery point while avoiding walls. The maze is represented as a $\backslash (4\backslash$times $6\backslash )$ grid, where each cell can either be $0$ or $1\mathrm{.}0$ and I denotes open space and a wall respectively. The maze has walls that the robot cannot pass through and it can move up$,$ down, left or right. A robot requires to navigate through a $\backslash (4\backslash$times $6\backslash )$ grid maze to reach a goal position at $\backslash ((0,5)\backslash )$ from the starting position at $\backslash ((3,0)\backslash ).$

a$)$ Construct the state space tree for finding the path between initial and goal position $(6$ marks$).$

b$)$ Determine which search technique, breadth$-$first search or depth$-$first search is more suitable for solving the given problem $(4$ marks$)$