Q1. Implement in Java the greedy algorithm for giving change with minimum number of coins: while (more coin-sizes && change

Execute program maxHeap.java and heapApplication.java(Attached Screenshot): Insert the nodes listed in  95 77 43 66 64 25 44 11 10 47  to the heap. Show screenshot. Display the heap array and compare it with the array in  95 77 43 66 64 25 44 11 10 47 . What do you find out? Max Heap import java.util.*; public class maxHeap{    public int heapSize, capacity;    public int[] Arr;    public maxHeap(int cap)    {        heapSize = 0;        capacity = cap;        Arr = new int[cap];    }     public void heapify(int parent)    {        int Lson, Rson, largest, temp;        Lson = 2 * parent + 1;        Rson = 2 * parent + 2;        /* find the largest among A[parent], A[lson] and A[rson] */        if ( Lson <= heapSize - 1 && Arr[Lson] > Arr[parent] )        {            largest = Lson;        }        else        {            largest = parent;        }        if (Rson <= heapSize - 1 && Arr[Rson] >…

There is an algorithm for making the heap complete:1. Remove the node at the root.2. Move the node in the last position to the root.3. Trickle the last node down until it is below.When this algorithm is applied continually, the data is removed from theheap in sorted order. imlement the code for the Remove and TrickleDownmethods:

This is Java programming! The current code for BstMaxHeap is printing names backwords. So please modify the code BstMaxHeap.java so it prints as the following: The heap is not empty; it contains 9 entries. The largest entry is Whitney   Removing entries in descending order: Removing Whitney Removing Regis Removing Megan Removing Matt Removing Jim Removing Jared Removing Doug Removing Brittany Removing Brett