on paper draw every step in each step

Let H$1,$H$2$ be two empty binomial heaps. At the end of each following step, draw H $1$ and H $2.$

Step $1$: Insert $\{1,2,3,4,5\}$ to H$1,$ insert $\{6,7,8,9,10\}$ to H$2.$

Step $2$: Merge H $1$ and H $2.$ The result is stored as H $1.$

Step $3$: Delete the minimum element of H $1.$ Delete the minimum element of H $2.$

Step $4$: Insert $\{11,12,13\}$to H$1.$

Step $5$: Merge H $1$ and H $2.$ The result is stored as H $1.$