Insert the following integers, one at a time and in the order given, to a binary min heap. (Do not use the buildHeap operation.) 50, 10, 25, 44, 36, 7
The integer items are stored in a basic array, according to the implicit representation presented in the lecture videos. Assume that the root item is stored at index 1. To indicate the state of the binary min heap after all items have been inserted, fill in the blank by providing the integer item stored at each array index.
Index 1:
Index 2:
Index 3:
Index 4:
Index 5:
Index 6: