You need to write a program $($preferably in Java$)$ to do the following:

Given a graph of $($nodes and edges$),$ find a path using the following algorithms:

$1-$ UCS

$2-$ GBFS

$3-$ A$*$

Use the class Vertex for the graph nodes

Name of the node: use alphabetic to represent the names e$.$g$.,$ A$,$ B etc....:

Driver program to $($TestGraph$.$java$)$:

$1-$ Read a graph of nodes; you can use a text file to read the graph from.

$2-$ Ask the user to find a path based on a choice of algorithm to use

$3-$ The output should be:

a$.$ The path given by the algorithm selected from point# $2$

b$.$ The cost of the path

c$.$ The nodes that are explored on the order they are visited

Use these graphs as the input for your program

Apply each of the following search algorithms on the following graph, where $S$ is the starting node and $L$ is the goal. The value on each edge represents its actual cost, while the value on each node represents the heuristic estimate from the node to the goal: