(a) In the open addressing schema, three probing techniques: linear probing, quadratic probing, and double hashing have been introduced. How many different probing sequences can be generated for each of the schemes if there are m entry slots? justify your answer. (b) Insert the keys 7, 6, 2, 13, 4, 6, 5, 12 into a min-heap once a time, then remove the key in the root repeatedly until the heap is empty. Use diagrams to illustrate each step of the insertion and deletion procedure. What is the time complexity of sorting in this fashion