(5) A d-ary heap is like a binary heap, but (with one possible exception) non-leaf nodes have d children instead of 2 children. (a) How would you represent a d-ary heap in an array? (b) What is the height of a d-ary heap of n elements in terms of n and d? Justify your answer. (c) Give an efficient implementation of ExtractMax in a d-ary max-heap. Analyze its running time in terms of d and n. (d) Give an efficient implementation of Insert in a d-ary max-heap. Analyze its running time in terms of d and n. (e) Give an efficient implementation of IncreaseKey(A, i, k), which flags an error if k