A d-ary tree is a generalization of a binary tree in which each internal node has d children. Using Eytzinger"s method it is also possible to represent complete d-ary trees using arrays. Work out the equations that, given an index i, determine the index of i"s parent and each of i"s d children in this representation.