In C++ program

Simulate the HEAP Sort from the given random Data. You need to show the process by showing the TREE representation and the ARRAY representations along with the operation which you are executing. Because we want to sort it by ascending order, it is recommended to have MIN HEAP as illustrated in the example of the lecture slide. First, you need to construct Min Heap representation from the given random data. Then you can use this Min Heap for Heap Sorting. Given random Data: 33, 55, 12, 7, 78, 65, 42, 89, 92, 104, 28 (2). (4 points) This is a programming homework. Program the above