Choose the option with function having same complexity for a fibonacci heap.

(a) Insertion, Union

(b) Insertion, Deletion

(c) extract_min, insertion

(d) Union, delete

My question is from Binomial and Fibonacci Heap in portion Heap of Data Structures & Algorithms I

I had been asked this question by my school teacher while I was bunking the class.