Request solve the following problem on "Alogrithms" The referred book is "Introduction to Alogrithms" by Thomas Cormen

b) Using Fig. 6.4 in page 137 (page 161 in third edition of the book as a model, illustrate the operation of HEAPSORT on the array A 5,12,4,8,10,11,9,7,6]. 14 9 63de14176cd9113000fa4ccedd 9113000fa4cceddb 1175 A 1 2 3 47 8 9 10 14 16 Figure 6.4 The operation of HEAPSORT. (a) The max-hcap data structureust after BUILD-MAX HEAP has buil in line1. (b)-G) The max-heap just after each call of MAX-HEAPIFY in line 5, showing the value of at that time. Only lightly shaded nodes remain in the heap(k) The resulting sorted aray A