Please refer to the screenshot below for the instructions:

Write a three graph search algorithms using them to solve basic puzzles.

Here are the $4$ java classes that'll be needed to contruct the three graph search algorithms:

DepthFirstSearch.java:

$//$ FIXME add imports here

public class DepthFirstSearch implements GraphSearchAlgorithm $\{$

public Path search$($State start, State goal$)\{$

$//$ FIXME add your code here

return null; $//$ FIXME delete when ready

$\}$

$\}$

GraphSearchAlgorithm.java:

public interface GraphSearchAlgorithm $\{$

public Path search$($State start, State goal$)$;

$\}$

BreadthFirstSearch.java:

$//$ FIXME add imports here

public class BreadthFirstSearch implements GraphSearchAlgorithm $\{$

public Path search$($State start, State goal$)\{$

$//$ FIXME add your code here

return null; $//$ FIXME delete when ready

$\}$

$\}$

AStarSearch.java:

$//$ FIXME add imports here

public class AStarSearch implements GraphSearchAlgorithm $\{$

public Path search$($State start, State goal$)\{$

$//$ FIXME add your code here

return null; $//$ FIXME delete when ready

$\}$

$\}$