Solve Path to the treasure problem $[2$pts$]$ You are standing in front of $3$ doors. If you open any of the doors you'll find yourself in a room that can be either empty, or contain a treasure. If there is no treasure in the room then this room is just like the first one: there are $3$ doors that you can open. Note that one of them is the door from which you came. The doors lead into exact same rooms with $3$ doors, and the rooms continue that way as nauseum. Yet in one of the rooms in this labyrinth there is a treasure. Which of the following algorithms will find it doing smallest number of steps $($into a room$-1$ step, out of the room $-1$step$)?$ Keep in mind that you are single person, so you cannot be in $2$ places at the same time.

i$.$ Backtracking graph search

ii$.$ Backtracking tree search

iii. BFS tree search

iv$.$ BFS graph search

v$.$ DFS tree search

vi$.$ DFS graph search

vii. Iterated DFS tree search

viii. Iterated DFS graph search

ix$.$ None of the above