Consider the algorithm for inserting a new item into a binomial heap H given in Section 5.8. A simpler method would be to create a binomial tree B*_0 as in step (i) of the algorithm, make it into a binomial heap, and merge this new heap with H. Why did we prefer the more complicated algorithm? Inserting a new item into a binomial heap H can be done as follows. Take the item to be inserted and convert it into a binomial tree containing just that one item. All that is required is to create a single node, and to initialize its value correctly. Call this new binomial tree B*_0. Set i leftarrow 0. If H includes a B_i, then remove the root of this B_i from the list of roots of H; link B*_i and the B_i from H to form a binomial tree B*_i + 1; set i leftarrow i + 1; and repeat step (iii). Otherwise go on to step (iv). Insert the root of B*_i into the list of roots belonging to H. If the item just inserted is larger than any other item in H, set H's pointer to point to the root of B*_i