What is the depth of a binary heap with 42 nodes? (assume the root is on depth 0)

a. What is the key value of the left child of 88?  b.What is the key value of the right child of 88?  c. Start with the original max-Heap. What is the key of the left child of the root (element 0 of the vector) after a pop() operation?

Write a function that converts a given min heap which is implemented by arravs to a max heap. The prototype of the function is queue "convert(queue "q).in c language

Q7 and 9  Please explain your answer

2.) C [10] = {5, 1,2,8,6,10,3,9,4,7} heap size = 10 Do Heapify (C, 1). What the values in the array C starting from the index 0 to 9?

Push 13 to the following min-heap and write the resulting heap array in the answer space. Write the array like a normal C++ array (e.g.: {67, 54, 123, ...}). 54 51 62 27 59 12pt ✓ Paragraph 28 ⠀ 50 Edit View Insert Format Tools Table 3 44 22 24

Data Structure/Operation Stack/Push Balanced Binary Search Tree/Delete Binary Heap/DeleteMin Hash Table/Find Vector/push_back Binary Heap/Insert Balanced Binary Search Tree/Delete Queue/pop Vector/Find Linked List/InsertAtHead Hash Table/Insert Average Complexity in Big-O 0 (1)

(b) Now consider storing a heap as a linked list with pointers. Give pseudo-code on how you would store a heap node, and which modifications you need to make to the heap routines that we discussed in class. What are the runtimes of the heap routines?

Simple JAVA linkedlist code implementation please help and complete any part you can - Without using the java collections interface (ie do not import java.util.List,LinkedList, Stack, Queue...)- Create an implementation of LinkedList interface- For the implementation create a tester to verify the implementation of thatdata structure performs as expected Build Bus Route – Linked List- Your task is to:o Implement the LinkedList interface (fill out the implementation shell)o Put your implementation through its paces by exercising each of themethods in the test harnesso Create a client (a class with a main) ‘BusClient’ which builds a busroute by performing the following operations on your linked list:o§ Create (insert) 4 stations§ List the stations§ Check if a station is in the list (print result)• Check for a station that exists, and onethat doesn’t§ Remove a station§ List the stations§ Add a station before another station§ List the stations§ Add a station after another station§ Print the…