1Initial heap: 2Heap size 9 with 0 stashed 3Heap in (id,value) pairs 40: 6 1 8 2 4 3 9 7 1 19 2 36 5 25 0 100 3 17 5Stash in (id,value) pairs 6Pop two items, increment, and place in stash: 7Heap size 7 with 2 stashed 8Heap in (id,value) pairs 90: 4 3 9 7 5 25 3 17 1 19 2 36 0 100 10Stash in (id,value) pairs 110: 8 12 6 11 12After unpacking the stash: 13Heap size 9 with 0 stashed 14Heap in (id,value) pairs 150: 4 3 9 7 5 25 6 11 1 19 2 36 0 100 3 17 8 12 16Stash in (id,value) pairs 17Sorted values: 180: 3 7 11 12 17 19 25 36 100 19