Consider this min heap: The array representation of this he…
Consider this min heap: The array representation of this heap after we insert 4 in this heap. Type your answers as numbers separated by spaces. Example: 1 2 3 4 Alt Text for the above Heap represented as a Complete Binary Tree: The image depicts a tree with the following structure:- The root node is labeled 5.- 5 has two children: 20 on the left and 10 on the right.- 20 has two children: 23 on the left and 40 on the right.- 10 has two children: 22 on the left and 21 on the right.- 23 has one left child labeled 25.