1) When removing an item from a min-heap, a "bubble down" operation is applied where, recursively, a value is swapped with that of it's smaller child. Prove that such a swap cannot increase the number of nodes that violate the heap ordering property