Consider the Heap Sort approach, answer the following questions: (1) Put the input data 2, 4, 5, 3, 1, 9, 6, 7, 10, 8 sequentially into an essentially complete binary tree according to the breadth-first order. (5%) (2) Please make the binary tree in (1) to be a heap tree. (5%) (3) Use the Heap Sort method to sort the input data in (1) and store the result to array S. Show your results step by step and write down the corresponding element S[i] of array S.