Consider two binomial queues BQ, and BQ, with n=2" and m=2 elements, respectively, where a) One DeleteMin is performed at each binomial queue and then they are merged to BQm. How long does it take, in average, to find the minimum key in BQm? b) Suppose that BQand BQ are first merged, and then two Delete Mins are performed. Suppose further that both minimum keys are at B. The second minimum key, located among the children of the root, is at the root of the most crowded binomial tree. What is your answer to the same question in part (a)? Consider two binomial queues BQ, and BQ, with n=2" and m=2 elements, respectively, where a) One DeleteMin is performed at each binomial queue and then they are merged to BQm. How long does it take, in average, to find the minimum key in BQm? b) Suppose that BQand BQ are first merged, and then two Delete Mins are performed. Suppose further that both minimum keys are at B. The second minimum key, located among the children of the root, is at the root of the most crowded binomial tree. What is your answer to the same question in part (a)