HOMEWORK 3: CS 425 (THEORY OF ALGORITHMS) DUE DATE: September 30, 2020, 7 pm 1. Build a MaxHeap using the following data. Show all steps, make a table similar to all other problems. Keep a column for...

HOMEWORK 3: CS 425 (THEORY OF ALGORITHMS)
DUE DATE: September 30, 2020, 7 pm
1. Build a MaxHeap using the following data. Show all steps, make a table similar to all other problems. Keep a column for runtime.
The data given are as below:
67, 39, 100, 54, 200, 80, 91, 198
    1
    2
    3
    4
    5
    6
    7
    8
    Runtime
    67
    39
    100
    54
I
    200
    80
    91
    198
L
    1
    67
    39
I
    100
    198
    200
R
    80
    91
    54
    
    67
I
    200
L
    100
R
    198
    39
    80
    91
    54
    
    200
    67
I
    100
    198
L
    39
    80
    91
    54
    
    200
    198
    100
    67
    39
    80
    91
    54
    
2. Write a C++ Program to implement the Build MaxHeap Algorithm. Use the pseudocode given in the notes.
#include
using namespace std;

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