Answer Happy

this is data structures. will give thumbs up
you answer fully and correctly! only answer
you know how to properly answer! thank you,
this is all one question just parts a and b , c and so forth. please answer all for thumbs up.
2. (20 points) Consider the following binary max heap (i.e., the array-representation of a heap-ordered complete binary tree). Here assume A<B<... <Z. Note that we introduced the binary min heap in slides. 0 1 2 3 4 5 6 7 8 10 11 12 9 F A Z W Y T G K V R S (a) Delete the maximum key. Give the resulting binary heap. Circle those values that changed. 0 1 2 3 4 5 6 7 8 9 10 11 12 (b) Insert the key X into the original binary heap. Give the resulting binary heap. Circle those values that changed. 0 1 2 3 4 5 6 7 8 9 10 11 12