1. (20 pts) A d-ary heap is like a binary heap except that non-leaf nodes have d children instead of 2 children. Please answer the following questions. (a) How to 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? (c) Describe how to insert an entry with key k into a d-ary max-heap and show that one insertion costs of love a time. (d) Describe how the removeMax operation works in a d-ary max-heap. What is the time bound for this operation in terms of n and d