Create a data type that allows you to insert, delete the maximum, and delete the minimum (all in logarithmic time), as well as find the maximum and find the minimum (both in constant time). Tip: Use two heaps.

Heapsort has heapified an array to: 96 71 57 36 25 and is about to start the second for loop. What is the array after each loop iteration? i= 4: Ex: 86, 75, 30 i = 3: i = 2: i = 1:

Create a list – l1 with element 1,2,3,4,5. Convert this list into an array name ar. What is the dimension of this array – one dimension, 2 dimension or multidimension What is the datatype of elements of array. Print the second element of an array. Create a nested list – l2 with three lists. Elements of each lists are – [1,2,3];[4,5,6];[7,8,9] Convert this list into an array ar2. What is the dimension of this array. Observe the parenthesis. Print 8 from this array. Without using list, create an array ar3, which has the even number from 2 -10. Use the np.arange(start, end, skip). Run the following code and observe the output.

Use Java : Delete N Nodes After M Nodes of a Linked List You are given the head of a linked list and two integers m and n.Traverse the linked list and remove some nodes in the following way:- Start with the head as the current node.- Keep the first m nodes starting with the current node.- Remove the next n nodes- Keep repeating steps 2 and 3 until you reach the end of the list.Return the head of the modified list after removing the mentioned nodes