Show the adjacency matrix representation for graph. [10 points] Show the adjacency list representation for graph. [10 points] Show the enumeration of the vertices for the graph using DFS method, starting at vertex B. [10 points] Show the enumeration of the vertices for the graph using BFS method, starting at vertex B. [10 points]

1. For the graph shown below, a. Show the adjacency matrix representation for graph. [10 points] b. Show the adjacency list representation for graph. [10 points] c. Show the enumeration of the vertices for the graph using DFS method, starting at vertex B. [10 points)] d. Show the enumeration of the vertices for the graph using BFS method, starting at vertex B. [10 points] 2. The root of a DAG (directed acyclic graph) is a vertex R such that every vertex of the DAG can be reached by a directed path from R. Write an algorithm that takes a DAG as input and determines the root (if there is one) for the graph. What's the asymptotic complexity of your algorithm? Note you don't need to implement your algorithm for this problem; please acknowledge properly if you get your ideas from the internet etc [20 points]