Data Structures and Algorithms (JavaProgramming)

a) Define the heap data structure, and define any datastructures refered to in this definition.

b) Why are heaps as used for heapsort most often implemented inarray form? Explain your answer.

c) How do you find the children of a node in the array in termsof the arithmetic involved?

d) How do you find the parent of a node in the array in terms ofthe arithmetic involved?

e) Describe the heapifyUpwards algorithm.