$\{9,10,23,15,28,76,50,48,37,96\}$Heap sort the keys by following these instructions and explain and provide the trace code of it

$$Mxx to remove the object with key xx from the root $($and so create a hole at the root$)$; $$L to move the hole down the heap by swapping the hole with its left child; $$R to move the hole down the heap by swapping the hole with its right child; $$Xxx to move object having key xx into the hole $($and delete the node that previously contained key xx$)$; with the coded operations in sequence on successive lines, e$.$g$.$Heap trace M$10$L L X$57$M$12$R X$39$M$15$L L X$84$