Please write a Java program that reads the adjacency matrix below (from a text file) and builds a graph using a linked allocation. In other words, the program should read the adjacency matrix below from a text file, build the graph using a linked structure (any version of a linked structure can be used to represent the graph), and process the graph to find all the paths.

A recursive or iterative solution may be used.

Array Lists or List classes from the Java library cannot be used.

Thanks in advance!!

Comments in the code will be very helpful!

Here is the adjacency matrix:

4 0 1 1 0 1 1 1 1 1 0 0 0 1 1 0 1 6 0 1 0 1 1 0 1 0 0 1 1 0 0 0 1 0 0 1 0 0 0 0 1 0 1 0 0 0 0 0 0 0 1 0 0 1 3 0 1 1 1 0 1 1 1 0