Please write code in Java

Programming: Directed Graphs Implement a method to compute the average out-degree for a graph, use the method signature below. The out-degree of a node is the number of outgoing edges it has. Assume that you are using the standard Directed Graph ADT discussed in class (see API below). You may not import any packages. Creating additional helper methods is fine but you should provide a one line comment that indicates their purpose. As an example, the following graph would have average in-degree of 1. 2 public class Digraph Digraph(int V) create a V-vertex digraph with no edges Digraph(In in) read a digraph from input stream in int VO number of vertices int EO number of edges void addEdge(int v, int w) add edge v->w to this digraph Iterable adj(int v) vertices connected to v by edges pointing from v Digraph reverse() reverse of this digraph String toString() string representation double averageOutDegree(Digraph G { //TODO: IMPLEMENT ME