Please write the method in java. Thank you so much.

WORK OUT THE SOLUTION TO THIS PROBLEM AND TURN IT IN AT RECITATION You are given a directed graph: class Neighbor { public int vertex; public Neighbor next; ... } class Vertex { String name; Neighbor neighbors; // adjacency linked lists for all vertices } public class Graph { Vertex [] vertices; // returns an array of indegrees of the vertices i.e. return [i] is the // number of edges that are directed IN TO vertex i public int[ ] indegrees () { // FILL IN THIS METHOD ... } ... } Assuming that the graph has already been read in, complete the indegrees method