Hi, any help please need help in this code for Java.

Please and thank you.. It's using array and sorting largest to smallest within array. Using Java

Part 1 - In Class Complete Binary Tree Complete binary trees have a simple representation using arrays. The representation may use a fixed-size array so that the number of nodes in the tree is limited to the size of the array or can use an array that grows according to the number of nodes. 1. The root always appears in the [0) component of the array. 2. If the data for a non-root node is in location [il then the data for the parent is always at location [(i-1)/21 3, If the data for a node is in location [i] then its children (if they exist) will always have their data at these locations: a. Left child at component [21+1) b. Right child at component 12i+2) Consider the following complete binary tree: NeuTree 14 1 3 10 30 17 40 21 12 Create a class for complete binary trees using an array representation. You should include the following methods: A method to add the nodes of the tree to an array representation (remember that insertion into an array will be done using level order traversal!). A method to print out the tree in the correct order of an array representation. A method to print out each parent and its children. If the parent has no children the output should display that the parent does not have a child. 1. 2. 3. woys to do order/mar