Recall that in a binomial heap, binomial trees of different orders appear in a sorted order, i.e., the root of binomial tree of a given order points to the root of a binomial tree of larger order. Consider a relaxed binomial heap where binomial heaps can appear in any order. The figure below shows a relaxed binomial heap.

a) Indicate whether time complexity of get-Max operation changes in relaxed binomial heaps compared to regular binomial heaps. If it does, indicate what the time complexity of get-Max is. Provide a brief justification of your answer.

b) Indicate whether time complexity of merge (union) operation changes in relaxed binomial heaps compared to regular binomial heaps. If it does, indicate what the time complexity of merge is. Provide a brief justification of your answer.

c) Indicate whether time complexity of extract-Max() operation changes in relaxed binomial heaps compared to regular binomial heaps. If it does, indicate what the time complexity of extract-Max is. Provide a brief justification of your answer.

80 50 90 70 40 30 20) 10 20 15 12 17 Relaxed Bionomia heap 80 50 90 70 40 30 20) 10 20 15 12 17 Relaxed Bionomia heap