a. Show that N inserts into an initially empty binomial queue takes O ( N ) time in the worst case..

a. Show that N inserts into an initially empty binomial queue takes O(N) time in the worst case. b. Give an algorithm to build a binomial queue of N elements, using at most N_1 comparisons between elements. _c. Propose an algorithm to insert M nodes into a binomial queue of N elements in O(M + logN) worst-case time. Prove your bound.