Write a program to create max heaps and min heaps using the STLalgorithms: make_heap, push_heap, & pop_heap. 2) Write afunction to print out an entire heap in tree format (the treedoesn’t have to be perfectly symmetrical or have the root at thetop of the display. 3) Employ the sort_heap algorithm, to sortheaps your min_heaps and max_heaps in both increasing anddecreasing order. 4) Properly document your code with commentsexplaining the effect that each function call is having on thestate of your program and write a summary report of your programthat includes the actual output. . . .