Algorithms and Data Structures Question on min-heap.

4. (5 points.) Suppose that d> 2 is an integer constant. In a d-ary tree, each node has d subtrees, some of which may be empty. For example, the trees discussed along with heaps had d = 2. We can represent a nearly complete d-ary tree with n nodes using an array A whose indexes range from 0 to n - 1. These are different from Cormen's arrays, whose indexes start at 1. Suppose that i is the index of a node in A. Then CHILD(i , j) is the index of the jth child of the node at index i, where 0 sj n. Write a (very) short procedure for CHILD that runs in O(1) time