Show that there are at most dn/2 h+1e nodes of height h in any n-element heap.
(b) for a min heap with n elements, what are the possible array subscript locations for the third smallest value in the heap? assume the array index begins at 1, and that all values are distinct. justify your answer.
(c) a d-ary heap is similar to a binary heap, except that nodes have d children instead of two children. justify your answers to the questions below.
i. what is the height of the tree representing a d-ary heap with n elements?
ii. what is the time taken for an insert operation in a d-ary heap? how does it compare with that for a binary heap?
iii. what is the time taken for a delete-max operation in a d-ary heap?

Why the bear has a slunky tail determine the meaning of the word slunk in the story

Write a car class having two private member variables called tank and speed. write public methods called pumpgas and gofast. the method pumpgas gets an integer for gas that must be pumped. that value needs to be added to tank (no more than 20 gallons). it must return the amount of gas that is purchased ($4 per gallon). the method gofast should increase the speed by 5 each time it is called.write a constructor for the above class that initialized both variables to zero.write a tostring to display both the tank and speed when the car is printed.modify the car class to implement the interface comparable and an interface called carinter having the public methods in carinter.write the main program to create an array of size 5 of type car. create 5 car objects having each location of the array to refer to one of the cars. test the pumpgas, gofast, equals method on the array items. write an enhanced loop to print all the car values (using a tostring written last time).write a generic method to find the minimum of four items. pass int, double, char, string and car objects to test this method.

Which of the following includes the three primary network access technologies? dsl, cable modem, broadband lan, wan, man voip, uc, iptv tcp/ip, ftp, dhcp