Give the below array of items, show all the steps in images that you would perform to create a max-heap from this array, assuming the given array is the initial tree representation when you start the routine. Also provide the pseudo/code for the sort routine 0 23 1 12 2 3 4 18 4 29 5 10 6 5 7 8 16 13 9 10 11 12 6 1 9 30