sorting algorithm is called stable if it maintains the original $($input$)$

order of the elements with equal keys $($i$.$e$.,$ values$).$

a$)$ Give a simple example $($can be as few as three elements$)$ to show HeapSort is

inherently unstable.

b$)$ Can you come up with a general idea to convert an unstable sort algorithm $($in$-$

cluding HeapSort$)$ into a stable one?