$($a$)(10)$ consider a min binomial heap with the following elements:

$11,14,12,10,24,30,23,44,17,22,13,28$

each element defines a min tree of the binomial heap. Perform a DeleteMin operation and show the resulting min trees. Show all steps.

$($b$)(2)$ state if the following statement is true or false:

Nk$=2^$k$,$ where Nk is the number of nodes in a degree k binomial tree