question 3

A ternary max-heap is similar to the binary max-heap that we have discussed in class, but now non-leaf nodes can have 3 children instead of 2. A ternary max-heap can be represented using an array. What are the indices of the parent and children of a node at index i? Write in pseudocode the shift down algorithm for a ternary max-heap. Let A be the following array