Answer this question in Java.

5. (4+4+7+ 10-25 marks) Given the graph shown below, answer the following questions: (4 marks) Illustrate the sequence of vertices of this graph visited using depth-first search traversal starting at vertex g. (4 marks) Illustrate the sequence of vertices of this graph visited using breadth-first search traversal starting at vertex b. (7 marks) Illustrate adjacency list representation and adjacency matrix representation, respectively, for this graph. What are the advantages and disadvantages of those two representations? (10 marks) Describe an algorithm to find in the graph a path illustrated below that goes through every edge exactly once in each direction a. b. c. d