[53, 49, 42, 33, 25, 16, 11,21] (d) (3 points) Write the binary-tree representation of the above heap after the largest element is removed