Draw the tree representations of the d-ary max-heaps from the following order of insertion. Then, convert the tree representations to array representations and store your result in variable output, located within the method dResult. You'll be performing the above process for d = {3, 4}. The array representation of d=3 will be stored in output[0], and the array representation of d=4 will be stored in output[1] Elements to insert: [53, 55, 56, 43, 47, 92, 61, 79, 85, 31, 20] 3-ary 4-ary

Draw the tree representations of the d-ary max-heaps from the following order of insertion. Then, convert the tree representations to array representations and store your result in variable output, located within the method dResult. You'll be performing the above process for d = {3, 4}. The array representation of d=3 will be stored in output[0], and the array representation of d=4 will be stored in output[1] Elements to insert: [53, 55, 56, 43, 47, 92, 61, 79, 85, 31, 20] 3-ary 4-ary