$($a$)5\%$ Describe the algorithm of deleting a key, $k,$ from a min$-$binomial heap $($assume that there is a pointer

points to $k,$ and there is a function DecreaseKey$(k).$

$($b$)5\%$ Show that the time required for deleting $k$ is $O(logn)($suppose that you know the $4$ properties of a

binomial tree$).$