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

Please answer the problem in the screenshot. Please use the methods below as a base.

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: 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.