In Java please

QUESTION:

Peg Solitaire is a game consisting of a playing board with 33 holes together with 32 pegs. In the picture above, the hole in the center is empty and the remaining holes contain pegs. The goal is to remove all the pieces except one, which should be in the center. A piece can be removed by jumping an adjacent piece over it into an empty hole. Jumps are permitted horizontally or vertically, but not diagonally. Program Depth First Search on this problem. You must create classes for the playing board, the successor function and the goal test, and make your classes work with the search code from the text. function DEPTH-LIMITED-SEARCH( problem, limit) returns a solution, or failure/cutoff return RECURSIVE-DLS(MAKE-NODE(problem. INITIAL-STATE), problem, limit) function RECURSIVE-DLS(node, problem, limit) returns a solution, or failure/cutoff if problem.GOAL-TEST(node.STATE) then return SOLUTION(node) else if limit = 0 then return cutoff else cutoff-occurred? false for each action in problem.ACTIONS(node.STATE) do child CHILD-NODE( problem, node, action) result RECURSIVE-DLS(child, problem, limit - 1) if result = cutoff then cutoff_occurred? true else if result + failure then return result if cutoff_occurred? then return cutoff else return failure Figure 3.17 A recursive implementation of depth-limited tree search