STUDY PROBLEM 9 Given an adjacency-list representation of a directed graph, how long does it take to compute the out-degree of a given vertex (number of edges going out of the vertex)? How long does it take to compute the in-degree (number of edges going into the vertex)? STUDY PROBLEM 10 Given the pseudocodes, analyze the computational complexity of the adjacency list version of the Dijkstra algorithm, and the adjacency matrix of the Dijkstra algorithm. For a given type of the graph (given in terms of the number of edges w.r.t. to number of vertices, e.g. E-5V) decide which one is (asymptotically) faster