The following undirected graph is provided: B A D E C (a) Write down its adjacency matrix representation and adjacency list representation. (2 marks) (b) Performing Depth-First-Search (DFS) on a connected graph produces a spanning tree. There are 6 possible spanning trees when we start DFS from B. Draw all the 6 spanning trees. (6 marks) (c) Performing Breadth-First-Search (BFS) on a connected graph produces a spanning tree. There are 2 possible spanning trees when we start BFS from B. Draw both spanning trees. (2 marks)