Please answer the problem in the screenshot. Please use the methods below as a base. The language is in Java . import java.util.*; class HeapMax { // we go with arraylist instead of array for size...

Please answer the problem in the screenshot.
Please use the methods below as a base.
The language is in
Java.

import java.util.*;

class HeapMax {

// we go with arraylist instead of array for size flexibility

private ArrayList data;

// DO NOT MODIFY THIS METHOD

public HeapMax() {

data = new ArrayList(0);

}

// insert a new element and restore max heap property

public void insert(int element) {

}

// return max

public int getMax() {

// remove this line

return 0;

}

// remove max and restore max heap property

public int removeMax() {

// remove this line

return 0;

}

// heap builder

public void build(int[] arr) {

}

// print out heap as instructed in the handout

public void display() {

}

// you are welcome to add any supporting methods

}

Extracted text: The task for this part is to implement max heap as a class in java. The class should be named "HeapMax"; in other words, the file name for this class would be "HeapMax.java". The max heap will have the following methods as: Constructor HeapMax: The constructor method should initialize the data storage for your data structure. You need to deal with the scenario when the storage is full if you use arrays or data structures that have inflexible sizes in other methods (e.g., insert). public HeapMax(O already finished for you ---- Insertion insert: This method inserts a new element to the max heap. You need to think about the scenario when a user tries to insert more elements than the original designated size (if you decide to implement the heap using array class). public void insert(int element) Get Max getMax: This method returns the root element of the max heap. You need to deal with the scenario when there are no elements in the heap while this method gets called. public int getMax() Remove Max removeMax: This method removes and returns the root element of the max heap, and reorganize the heap accordingly to restore its max heap characteristics. You need to deal with the scenario when there are no elements in the heap while this method gets called. public int removeMax()


Extracted text: Display Heap display: This method should print all elements in the max heap in the order of levels (e.g., root element first, root's two children second, root's grandchildren third, etc.). Elements on the same level should be separated with one or two white spaces; elements on different levels should be separated with a comma. public void display() Build a Heap build: This method should take an array as the only parameter and build a heap based on the given array. Note that this method is NOT supposed to be called if a heap is non-empty. public void build(int[] arr) These methods should NOT be declared as static. You are free to use any extra instances and helper methods.