a$.$ Construct a heap for the list M$,$ I, D$,$ T$,$ E$,$ R$,$ M by the bottom$-$up algorithm. $($show graphical

representation after each swapping$).$

b$.$ Construct a heap for the list $1,8,6,5,3,7,4$ by successive key insertions $($Insert each element one by

one, show graphical representation after each insertion$).$

c$.$ Sort solution of part a$.$ in alphabetical order by using heap sort. $($Show heap structure after each

iteration$).$