In the max$-$heap below you do one remove operation. Use the convention where the first element is at index $1.$

Consider the heap AFTER this operation. Give the pairs $($index$,$value$)$ for every element of the heap that was modified $($that is that is now different from what it was before remove$()).$List the pairs in increasing order of the index. Separate them by comma. Do not put any empty spaces. Indicate with $($index$,$x$)$ the index in the heap for which the node was removed.

In the max$-$heap below you do one remove operation. Use the convention where the first element is at index $1.$

Consider the heap AFTER this operation. Give the pairs $($index$,$value$)$ for every element of the heap that was modified $($that is that is now different from what it was before

remove$()).$List the pairs in increasing order of the index. Separate them by comma. Do not put any empty spaces. Indicate with $($index$,$x$)$ the index in the heap for which the node

was removed.