-- can you please solve it and provide a simple explanation if possible.

Consider a graph given through the adjacency list representation below: Vertex Adjacent vertices a, d, e a) ( mark) Draw a graphical representation of the graph. b) (I mark) Is the graph strongly connected? Explain why or why not. If it is not strongly connected, specify the strongly connected components. c) (I mark) List all simple paths between d and c? d) (2 marks) Does the graph have an Euler circuit/path? Justify why or why not. If yes, also show how the circuit/path can be constructed. e) (2 marks) Consider the undirected graph obtained by transforming each edge into an undirected one. What is the maximal subgraph (same number of vertices and maximum number of edges) that is bipartite? f) (2 marks) Determine the vertex connectivity x(G) of the corresponding undirected graph. Specify a separating set with K(G) vertices