10. A d-heap is a generalization of a binary heap that is exactly the same as a binary heap, except that each node has d children. Thus, a binary heap is a 2-heap, and a ternary heap is a 3-heap. (a) Recall that a binary heap can be represented as an array. Given a node at index i in this array, the formulas for finding the index of the parent and left/right children of this node (assuming one-based indexing) were given during discussion section. Suppose we are implementing an array representation of a ternary heap. Given a node at index i in this array, give the formula for finding the index of the parent, and give the formulas for finding each of the children of this node. (b) Repeat the previous problem, except with zero-based indexing instead (i.e. the root of the ternary heap is at index 0 in the array)