java thx an advance

I just need Question 2 question already solved

For the undirected graph below a- Give the adjacency matrix representation b- Give the adjacency list representation Change the graph in question 1 to be a directed graph. All the existing edges should be directed from vertexes with a letter later in the alphabet to vertexes with a letter earlier in the alphabet (e.g. if there was an edge A B in the graph in question 1, that edge should now become A leftarrow B). a- Give the adjacency matrix representation b- Give the adjacency list representation c- Give the order the vertexes are visited in a Depth-first Traversal starting at vertex G and continuing until all reachable vertexes have been visited. Neighboring nodes should be pushed to the stack in alphabetical order (e.g. if a node has 3 neighbors A, B, C, then A is pushed first, then B, then C) d- Give the order the vertexes are visited in a Breadth-first Traversal starting at vertex G and continuing until all reachable vertexes have been visited. Neighboring nodes should be added to the queue in alphabetical order (e.g. if a node has 3 neighbors A, B, C, then A is added first, then B, then C)