Consider the following initial state of eight puzzle problem, solve it using following search to level 3 to populate the OPEN and CLOSE list i.Breath First ii.Depth First iii.Best Search iv.Uniform cost v.Iterative deepening 12 345 678