I have an assaignment from Data Structures and Algorithms. It is a directed graph question that needs to be solved with JAVA language. We are are not allowed to use any external library or jar file. Any solutions without using graph data structure will not be evaluated. $*$IMPORTANT THING IS$*$: In this question there are THREE PROGRAM and $1$ text file. Three program will be named as:

$-$ Valuefinder: take the value of txt file and convert the integer

$-$ FileRead: read the text file. $-$ HW$2\_$Q$2\_$solution: Create your graph, find the nonconnected neurons and write the path to the neurons which is started in $0$ and end in the number of neuron. Write all possible paths. Thank you in advance! Question $2(25$ points$)$:

In the below, the neural network of the artificial intelligence is given; however, some neurons do not connected to the next neurons. From using the graph and HW$2\_$Q$2\_$text find these neurons.

The sample output is given, but the result part has been erased. In your program result must be written. The result part example must be like this:

If the neuron Is $11$ :

$011$

If the neuron is $20$ :

$01020,$ however all the possible other connections for $11,12....$must be added

The result:

$011$

$01020$

$!!!$ In this question there are three program and $1$ text file:

Valuefinder. take the value of tst file and convert the integer

FileRead: read the test file.

HW$2\_$Q$2\_$solution: Create your graph, find the nonconnected neurons and write the path

to the neurons which is started in $0$ and end in the number of neuron. Write all possible paths.

Sample Output: $(!!$ I uploaded the picture of the question, please take a look at the graph and the output. Thanks again$)$