3. (2 points) In the adjacency list representation for directed graphs, for every vertex u, a list of vertices to which v has a directed edge is stored. The in-degree of a vertex v is the number of vertices that have a directed edge to v. Given a directed graph in adjacency list representation, design an algorithm that computes the in-degree of all the vertices. Give pseudocode for your algorithm and discuss running time