Show the first pass of sorting the following array-based binary tree max-heap. In other words, show the first step in sorting, then re-heap the remaining tree into a max-heap. (You will not need all the columns; Coloring is not required) 56 40 36 21 35 22 25

This is C++ Programming

Please don't use handwritting Six integers are given in this order: 8, 4, 3, 5, 9, and 6. Do each of the following. SHOW YOUR WORK step by step.1. Create an AVL tree by inserting the integers in the given order.2. Create a (2,3) tree to store these data.3. Create the max-heap using the bottom-up approach. You need to provide both tree and arrayrepresentations for the heap.

Turn the following array-based binary tree into a max-heap. Show your work step by step. You will not need all the columns; Use null to fill the unneeded spaces. Use scratch paper to draw the trees at each step. 38 18 24 52 43 34 26