Simplified Red-Black Trees 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 sup 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 ComparableE E {extends ComparableE static Node staticRED: boolean false -element: E -leftChild: Node right Child: Node parent: Node -color boolean static-BLACK: boolean true ToOt: Node tinsert(element: E): boolean (throws NullPointerException) +contains(object: ComparablecE>: 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: 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