9. Figure Q.9 shows the search tree where the aim is to reach a state with label "L". Working on the basis that each algorithm is implemented so that by default it first searches items to the right of tree (as you look at the screen). an Figure Q.9 Calculate the number of steps needed (including the head node and the goal) and the states in the queue at each step before reaching the goal state if you are using: (a) Depth First Algorithm. [4 marks] (b) Breadth First Algorithm. [4 marks]