I have an assaignment from Data Structures and Algorithms. It needs to be solved with Java. 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

writen. The result part example must be like this:

$11$ we weund Is $11.$

$011$

If the neuron is $20$ :

$01020,$ however all the possible other connections for $11,12$dots 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: