Heaps
Can someone help me solve this problem? thank you so much A heap data structure can be efficiently implemented in a range using the C++ Standard Template Library (STL). In this exercise you are asked to utilize STL in order to build and manipulate a heap efficiently. In particular, you are requested to: 1. Make a heap consisting of 10 different integers of your own choosing. Include a statement to show the maximum element of the heap. 2. Add a new value that is the mean of the random values you creates in the previous step. Floor the value if needed (truncate decimal part). 3. Delete the maximum element of the heap and 4. Sort the heap. Write down the code to achieve all the operations mentioned above and clarify which section of the code does what.