b) A 4-ary max heap is like a binary max heap, but instead of 2 children, nodes have 4 children. A 4-ary heap can be represented by an array as shown in Figure 1 (up to level 2). A[0] A[1] A[2] A[3] A[4] A A A A A A A A A. A A [10] (13)14 [5] [6] [8] [9] [11] [12] (14] (15] [16] (17] (18] (19] [20] Figure 1: 4-ary heap representation using an array Write down MAX_HEAPIFY(A,i) function for a 4-ary max-heap that restores the heap property for ith node.

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.