Let $T$ be a B-tree of minimum degree $t \ge 2$. During the deletion of a key $k$ from an internal node $x$, suppose $k$ is stored in $x$ at index $i$. Which of the following actions correctly preserves all B-tree invariants before the recursive deletion proceeds?