Q7 10 Points A d-max-heap is like an ordinary binary max-heap, except that nodes have d children instead of 2. Q71 5 Points Describe how a d-max-heap can be represented in an array A[1...nj. In particular, for the internal (non-leaf) node of the d-max-heap stored in any location A[i], consider the positions in Al hold its child nodes. Assuming the indices start at 0, select the ones that are correct. (no partial credit) 1 st child is at A[d*i-d+1) 2 nd child is at A[d*(-1)+1] dth child is at A[d'i] kth child is at Afdk+1] Q7.2 5 Points What is the height of the heap to be the number of nodes on the longest path from the root to a leaf. In terms of n and d, what is the height of a d-max-heap of n elements? O log, O logon logan O Inn