5. Analysis of tertiary heaps: A ternary heap is like a binary heap, non-leaf nodes have 3 children instead of 2 children. a. How would you represent a ternary heap in an array? b. What is the height of a ternary heap of n elements in terms of n? c. Give an efficient implementation (in pseudo code) of EXTRACT-MAX in a tertiary max-heap. Analyze its running time in terms of n. d. Give an efficient implementation (in pseudo code) of INSERT in a ternary max- heap. Analyze its running time in terms of n. e. Give an efficient implementation (in pseudo code) of INCREASE-KEY(A,i,k), which flags an error if k