Write a code to implement the heap sort algorithm in JAVA or Python. Test your program with different sets of data and take screenshots. Copy and paste your code and screenshots into a Word document....

Assignment
import java.util.*;
import java.io.*;
public class Main
{
    public static void main(String[] args) throws IOException{
        int[] arr = {8,2,5,3,0,1,19,21,17,84};
        heapSort(arr);
    }
    
    static void heapify(int[] arr, int n, int i) {
int largest = i;
int left = 2 * i + 1;
int right = 2*i+2;
if (left < n && arr[left] > arr[largest])
largest = left;
if (right < n && arr[right] > arr[largest])
largest = right;
if (largest != i) {
int tmp = arr[i];
arr[i] = arr[largest];
arr[largest] = tmp;
...