$(75)[$Depth$-$first search: programming$]$ Write a Java program code that implements the

depth$-$first search algorithm $($for a connected graph$)$ using the LIFO queue $($studied in class$)$ and

run the program against the graph shown below $($left$).$ An adjacency list $--$ not an adjacency

matrix or an edge list $--$ structured as shown below $($right$)$ must be used as the data structure of

the graph. Use exactly the same order of nodes connected to each node array entry as shown in

the linked list, or your program output may be different. In each run, the program should prompt

a screen input of the node number $(1$ to $8)$ and, once the number is entered, output the node

number each time a new node is visited during the graph traversal. Your program code will be

tested for multiple alternative start nodes. Program codes should be working and neatly

organized and well commented.