Consider the 8-Queens problem such that the 8 queens are distributed in the columns of the initial state (one queen in each column) and all pairs of queens, in this initial state, are attacking each other (i.e. they are all in the same line). The queens can move to any square horizontally and vertically and the cost for each move horizontally or vertically to any square equals to 5. (1) Which of the following search strategies is the best one for solving this problem: a) Breadth-first search b) Depth-first search e) Uniform cost search d) Depth-limited search with depth limit -4 (2) What is the branching factor of this problem?