Question 3: (10 marks) Given the following array Arr[G, L, D, I, S, B, F, H, K, O, T, E, C), answer the following set of questions: a) Draw the heap presentation of this array (2 marks) b) Find the pre-order traversal of this tree. (2 marks) c) Implement Max-Heapify and show the last presentation (2 marks) d) Explain briefly the algorithm of the Heap-sort in few steps (2 marks) e) Estimate the number of steps (in the worst case) needed to sort this array using Bubble-sort and heap-sort algorithms (2 marks)