Question 1 (20 pts): Peg solitaire ("Solo Test" in Turkish) is a board game for one player involving movement of pegs on a board with 33 holes. The shape of the board can be seen in the figure below. Initially, all the holes except the center hole are filled with pegs. A valid move is to jump a peg orthogonally over an adjacent peg into a hole two positions away and then to remove the jumped peg. The objective is, making valid moves, to empty the entire board except for a solitary peg in the central hole. OL a. (4 pts) What is the branching factor at the first level of the search tree? b. (4 pts) What is the depth of the solution? c. (6 pts) Would you use the general tree search algorithm or general graph search algorithm for this problem? Why? d. (6 pts) Which uninformed search strategy is the best suitable strategy for this problem? Why? Question 1 (20 pts): Peg solitaire ("Solo Test" in Turkish) is a board game for one player involving movement of pegs on a board with 33 holes. The shape of the board can be seen in the figure below. Initially, all the holes except the center hole are filled with pegs. A valid move is to jump a peg orthogonally over an adjacent peg into a hole two positions away and then to remove the jumped peg. The objective is, making valid moves, to empty the entire board except for a solitary peg in the central hole. OL a. (4 pts) What is the branching factor at the first level of the search tree? b. (4 pts) What is the depth of the solution? c. (6 pts) Would you use the general tree search algorithm or general graph search algorithm for this problem? Why? d. (6 pts) Which uninformed search strategy is the best suitable strategy for this problem? Why