Hi there! I need help creating a new class called BetterDiGraph that implements the EditableDiGraph interface $($code included below$)$provided by my teacher. There is also more information provided about the assignment included in the photo above.

DO NOT USE ANY STAR IMPORTS OR PACKAGES OTHER THAN THE FOLLOWING:

java.io$.$BufferedReader

java.io$.$BufferedWriter

java.io$.$File

java.io$.$FileInputStream

java.io$.$FileNotFoundException

java.io$.$FileOutputStream

java.io$.$FileReader

java.io$.$InputStreamReader

java.io$.$IOException

java.io$.$OutputStreamWriter

java.io$.$UnsupportedEncodingException

java.util.HashMap

java.util.LinkedList

java.util.NoSuchElementException

Here is EditableDiGraph interface provided:

package edu.ser$222.$m$04\_02$;

import java.util.NoSuchElementException;

$/**$

$*$ Implements an editable graph with sparse vertex support.

$*$

$*$ @author Acuna

$*$ @version $2/17/24$

$*/$

public interface EditableDiGraph $\{$

$/**$

$*$ Adds an edge between two vertices, v and w$.$ If vertices do not exist,

$*$ adds them first. Does not allow duplicate $($parallel$)$ edges to be created.

$*$

$*$ @param v source vertex

$*$ @param w destination vertex

$*/$

void addEdge$($int v$,$ int w$)$;

$/**$

$*$ Adds a vertex to the graph. Does not allow duplicate vertices.

$*$

$*$ @param v vertex number

$*/$

void addVertex$($int v$)$;

$/**$

$*$ Returns the direct successors of a vertex v$.$

$*$

$*$ @param v vertex

$*$ @return successors of v

$*/$

Iterable getAdj$($int v$)$;

$/**$

$*$ Number of edges.

$*$

$*$ @return edge count

$*/$

int getEdgeCount$()$;

$/**$

$*$ Returns the in$-$degree of a vertex.

$*$ @param v vertex

$*$ @return in$-$degree.

$*$ @throws NoSuchElementException exception thrown if vertex does not exist.

$*/$

int getIndegree$($int v$)$ throws NoSuchElementException;

$/**$

$*$ Returns number of vertices.

$*$ @return vertex count

$*/$

int getVertexCount$()$;

$/**$

$*$ Removes edge from graph. If vertices do not exist, does not remove edge.

$*$

$*$ @param v source vertex

$*$ @param w destination vertex

$*/$

void removeEdge$($int v$,$ int w$)$;

$/**$

$*$ Removes vertex from graph. If vertex does not exist, does not try to

$*$ remove it$.$

$*$

$*$ @param v vertex

$*/$

void removeVertex$($int v$)$;

$/**$

$*$ Returns iterable object containing all vertices in graph.

$*$

$*$ @return iterable object of vertices

$*/$

Iterable vertices$()$;

$/**$

$*$ Returns false if the graph contains at least one vertex.

$*$

$*$ @return boolean

$*/$

boolean isEmpty$()$;

$/**$

$*$ Returns true if the graph contains a specific vertex.

$*$

$*$ @param v vertex

$*$ @return boolean

$*/$

boolean containsVertex$($int v$)$;

$\}$