1. Consider a string array representing a binary heap with the words {"zero", "one", "two", "three", "four", "five", "six", "seven", "eight"} stored in it's positions 1 to 9

o Draw the corresponding binary heap!

o For which of the inner nodes the heap condition is violated?

o Consider the code i=4; while(i-->0){sink(i);} Draw the binary heap after each iteration!

o After executing that code, for which inner nodes the heap condition is violated now?

o Write down the corresponding array!