Define, discuss and explain the heap data structure. In your answer, ensure that you address the following points: Define and explain the following terms: heap, binary heap, heap property, min heap and max heap. Heaps are usually implemented as arrays and yet are visualised as trees. Why might this be unusual? What properties of a heap make it possible to implement the heap as an array? Show with a diagram how any array can be considered as a heap.