Separate the digits of your eight-digit student number with commas. From these numbers, write 1 to the left of the first, 2 to the left of the second, ... 8 to the left of the eighth. For example, if your student number is 20822608, after first separating the numbers 2,0, 8, 2, 2, 6,0. 8 your numbers will be 12, 20, 38, 42, 52. 66, 70. 88. With the help of BuildHeap () function, create a Heap with maximum properties. Note: Assuming that these numbers are sent as an array to the BuildHeap () function, you need to explain step by step how the function works. Warning: In the initial step you need to place the numbers in the binary tree at the same time, not one by one. Otherwise, your solution will not be evaluated