In Java build a max-heap in two ways 1) use sequential insertion 2) use the optimal method ( Repeatedly apply reheap operations on all nonleaf nodes) Not only that but they must be able to get : i. The first 10 integers in your array; ii. The number of swaps for both methods mentioned. iii. Then perform 10 removals on the heap and output the first 10 integers. No duplicate numbers are allowed