lets say these are are a representation of max-heap 21 14 7 9 12 5 what do we get after one call of removemax. use . to separates the values Now what do we get after inserting 27 to the resulting heap . to separates the values

: Implement an algorithm to delete a node in the middle (i.e., any node butthe first and last node, not necessarily the exact middle) of a singly linked list, given only access tothat node.EXAMPLElnput:the node c from the linked lista->b->c->d->e->fResult: nothing is returned, but the new linked list looks like a->b->d->e->f

What is the minimum number of items that must be exchanged during a remove the maximum operation in a heap of size N with no duplicate keys? Give a heapof size 15 for which the minimum is achieved. Answer the same questions for two andthree successive remove the maximum operations

You're given an array A[1...7] Heap-Insert(A, 8), what is the resulting A? (9, 7, 6, 4, 1, 5, 3). If you execute Max-

If you have a stack that contains 3000 integers, and you need to see if it contains the number 5678, what is the worst case scenario in terms of the number of operations you would have to do? You can use a second stack. Count every peek, push, pop and comparison, and assume you need to ensure that the integers in the collection maintain their order in the original stack.

Is the following vector a max heap?100, 40, 60, 10, 15, 61, 40a. Yesb. No it is not

Heap  is used to implement the priorityqueue. Revise the implementation using a sorted array list to store the elementsand name the new class PriorityUsingSortedArrayList. The elements inthe array list are sorted in increasing order of their priority with the last elementhaving the highest priority. Write a test program that generates 5 million integersand enqueues them to the priority and dequeues from the queue. Use the samenumbers for MyPriorityQueue and PriorityUsingSortedArrayList anddisplay their execution times.

Why is it giving me an error and what do I have to change? PYTHON # Problem 2# Implement a hashtable using an array. Your implementation should include public methods for insertion, deletion, and# search, as well as helper methods for resizing. The hash table is resized when the max chain length becomes greater# than 3 during insertion of a new item. You will be using linear chaining technique for collision resolution. Assume# the key to be an integer and use the hash function h(k) = k mod m where m is the size of the hashtable. You can use# python list methods in your implementation of the chain or you can also use your linked list implementation from# coding assignment 2, problem 1. You can make necessary changes to  __hashtable initialization in the __init__ method# if you are using your linked list implementation. The provided code uses python lists for the __hashtable variable. class HashTableChain:    def __init__(self, size=10):        # Initialize the hashtable with the given…

What is an appropriate implementation for the goal stack in (2)? Do we really need to keepit as a list of integers, or will a more succinct representation do?

Must attach output screenshot, editable output   In java Implement a generic min heap class and write a test code to test the program. Use hashmap for the update method. You can also use it for the getIndex method. public int getIndex(AnyType x) {//average case O(1) //returns the index of the item in the heap//or -1 if it isn't in the heap //return -1;      }public boolean update(AnyType x) {//O(lg n) average case//or O(lg n) worst case if getIndex() is guarenteed O(1) We want an update() operation which increases (or decreases) the priority of the item. The item (or an equal item) will be provided and it should update the priority queue appropriately. The only way to do this efficiently is to use a map to map heap items to indexes so that you know where to start the update (in average case O(1) time). Without this, update() would be O(n) and not O(lg n). Therefore before you implement updating, you need to integrate a map into the code. Whenever an item is placed, moved, or removed…