Build a Min Heap from the given array Mimo. Write an algorithm for building the Min Heap (Min-Heapify).   Mimo [10] = {1, 4, 2, 6, 3, 5, 7, 9, 8, 10}

For a given heap below: M (K A F H. The array representation of the heap is givep below. 1 2 3 4 Y W M 15 K 11 H. 6. 10 12 F a) Delete the root node, give the resulting heap. 3 1 2 4 6 10 11 12 b) Insert Q into the original heap, give the resulting heap. 3 12 4 16 10 11 12 TTTT Paragraph E- E T Arial 3 (12pt) T T. OS. Mashups HTML CSS O Type here to search

What does the initially empty max-heap h contain after the following sequence of pseudo-code operations? Show at least 5 binary heaps as stated in Figure 1 to show the changes after a sequence of heap operations.

What is this question asking? Such what would the solution to this prompt be, in regarding it?

Design a class to perform various matrix operations. A matrix is a set of numbers arranged in rows and columns. Therefore, every element of a matrix has a row position and a column position. If A is a matrix of 5 rows and 6 columns, we say that matrix A isof the size 5 × 6 and sometimes denote it as A5×6. Clearly, a convenient place to store a matrix is in a two-dimensional array. Two matrices can be added and subtracted if they have the same size. Suppose that A = [aij] and B = [bij] are two matrices of the size m × n, where aijdenotes the element of A in the ith row and the jth column, and so on. The sum and difference of A and B is given by: ?+ ?= [???+ ???]?− ?= [???−???]The multiplication of A and B (A * B) is defined only if the number of columns of A are the same as the number of rows of B. If A is of the size m × n and B is of the size n × t, then A * B = [cik] is of the size m × t and the element cikis given by the formula: ???= ??1?1?+ ??2?2?+ ⋯+ ??????Matrices A and B are…

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] >…

To get the alphabet in order, heap sort the list L = D, B, G, E, A, H, C, and F. Pseudocode all the stages, please?

Suppose we have an ArrayHeap that uses the array representation from class (also called "tree representation 3B" in lecture). Recall that in this representation that the leftmost item is unused. Consider a heap with the following underlying array: -8 -2 9. 1 10 10 12 Suppose we perform an in-order traversal of the heap represented by this array. What will be the last value in the in-order traversal? O -8 O 5 O-2 O 9 O 8 O 1 O 10 O 12