10%] Describe how you can represent a n-vertex directed multigraph using an n x n adjacency matrix. And present algorithms and analyze their complexities for answering the following questions. (a) Given a vertex i, the in-degree and out-degree of i (b) Given two vertices i and j, report if j can be reached from i in the graph. (c) Determine if a given directed multigraph is connected or not (i.e, for any vertices i and j, there exists a directed path from i toj.) Report if the graph has a directed cycle. (d) 10%] Describe how you can represent a n-vertex directed multigraph using an n x n adjacency matrix. And present algorithms and analyze their complexities for answering the following questions. (a) Given a vertex i, the in-degree and out-degree of i (b) Given two vertices i and j, report if j can be reached from i in the graph. (c) Determine if a given directed multigraph is connected or not (i.e, for any vertices i and j, there exists a directed path from i toj.) Report if the graph has a directed cycle. (d)