anyone can help with a step by step solution I would really appreciate it

Sort the characters in the array below in ascending alphabetical order using the heapsort algorithm. The array is initially a maxheap. For each step k in the diagram below, show the complete array after k elements have been placed in their final sorted position with the remainder of the array having been transformed back into a heap. Use one column of the diagram below for each step. You may not need all the columns. Initial array: Z O M B I E