$//$ PLEASE DRAW AND SHOW ALL THE STEPS NEEDED$///////($a$).$ Construct an essentially complete binary tree of the array$[4,5,8,13,13,3,6,19,29,5,31]($b$).$ Transform the essentially complete binary tree of $($a$)$ to a binary search tree. Show all the steps! $($c$).$ Transform the binary search tree of $($b$)$ to a min heap. Show all the steps! $($d$).$ Transform the essentially complete binary tree of $($a$)$ to a min heap using the "static" heap construction approach. Show all the steps, including the changes in the array for each iteration. Are the min heaps of $($c$)$ and $($d$)$ the same?