Can someone please help me on this Java Assignment?

The task of this project is to implement in Java a red-black tree data structure. However, the tree will be simplified you only need to support insertion, not deletion Specification The project must implement the following specification exactly, including all identifier names, method signatures, the presence or absence of exceptional behavior, etc. That being said, anything not clearly indicated by the UML diagram(s) or explicitly stated in the description is left up to your discretion. You may also add private helper methods or additional fields as necessary Structure E extends Comparable E extends Comparable static Node RedBlackTree static-RED: booleanfalse -element: E -leftChild: Node rightChild: Node static-BLACK: boolean = true -root: Node +insert(element: E): boolean throws NullPointerException) +contains(object: Comparable>) boolean parent: Node -color: boolean +toString0: String Note that a box with a dashed border over the top right of a class entity denotes a generic type parameter. In this case, the red-black tree class has a generic type named E that extends Comparable interface is located in the iava.lang package, so it is not necessary to import it. Finally, for this project you should locate your code in the default package. Behavior insertshould insert the given element into the tree at the correct position, and then rebalance the tree if necessary. The correct position is defined by the properties of a binary search tree, and the rebalancing procedure should enforce the properties of a red-black tree. Regarding input validation, insert should immediately throw a NullPointerException with a descriptive message if the given element is null. Alternatively, if the given element is a duplicate of arn element already in the tree, then insert should not insert the given element. The return value should indicate whether the given element was inserted into the tree or not Two elements are considered duplicates iff (if and only if) they compare equal to each other using the compareTo method. Likewise, the ordering of any two elements for the purposes of insertion and rebalancing is given by the same method contains should return whether the tree contains any element that compares equal to the given obiect using the compareTo method of the object. This means that vou should always do object.compareTo (element) but never do element.compareTo (object)