Data Structures:

PROBLEM 4 The in-degree of a vertex v in a directed graph G = (V,E) is the number of incoming edges that v has. An incoming edge of v is an edge (u, v), i.e. v is the head of (u, v). Conversely, (u, v) is an outgoing edge of u. Assume that you have are given a graph G and the edges are represented as an adjacency list for