I have an assaignment from Data Structures and Algorithms. $!!$ IT NEEDS TO BE SOLVED USING JAVA!! There is a graph and requested$($sample$)$ I will attach the necessary images and inputs So please take a good look when solving or writing the code. Thank you in advance. Here is the description: In this part, you must implement your own graph data structure by taking inspiration from the textbook $($Algorithms $(4$th Edition$)($Robert Sedgewick, Kevin Wayne$))$ and use it to help to solve problem. You are not allowed to use any external library or$.$jar file. Any solutions without using graph data structure are not evaluated! Question $2(25$ points$)$:

Find the shortest path for starting point is $0$ and assume that finish points are $1,2,3($find each points shortest path$).$ In the question the output must shown in order. The graph is directed graph. Sample Output:

V$=4$

E$=11$

$01200$

$03100$

$10200$

$12240$

$13197$

$20200$

$21240$

$23100$

$30100$

$31197$

$32100$

The result

$............$

$............$

$............$ The example output is:

$01200$

$012440$

$03100($this is only example not the result$)$

Important Note: Please do not forget. The result will be contain $2$ point and $1$ value or $3$ point and value.

The starting point is $0$ and the final point is firstly $1,$ secondly $2,$ thirdly $3.$ The shown graph is directed

graph.

In the question you create $3$ java document and one text file:

HW$3\_$Q$2\_$solution: Main body, find the solution of Shortest Path.

$,$ FileRead: read the text file.

Valuefinder: take the value of txt file and convert the integer and create the directed

graph.

HW$3\_$Q$2$: text file $($I uploaded to the system$)$

In the questions, your explanations are very important. The example output is:

$01200$

$012440$

$03100($this is only example not the result$)$

$!!$ Important Note: Please do not forget. The result will be contain $2$ point and $1$ value or $3$ point and value.

The starting point is $0$ and the final point is firstly $1,$ secondly $2,$ thirdly $3.$ The shown graph is directed graph.

In the question you create $3$ java document and one text file:

$-$ HW$3\_$Q$2\_$solution: Main body, find the solution of Shortest Path.

$-$ FileRead: read the text file.

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

graph.

$-$ HW$3\_$Q$2$: text file $($I uploaded to the system$)$

In the questions, your explanations are very important. Here is the sample input for the code: $4$

$11$

$01200$

$03100$

$10200$

$12240$

$13197$

$20200$

$21240$

$23100$

$30100$

$31197$

$32100$

It would be very helpful if you also put comments to the code that explains the functions and their preorder & postorder states. Thanks.