Insertion of a set of n keys, in the given order, into an initially empty dictionary or a (min.) priority queue T takes in the worst-case a. O(n) time, if Sis in arbitrary order and Tis a Splay Tree. O b. On log n) time, if Sis in increasing order and T is a Leftist Min-Heap. c. 06 time, if S is in increasing order and I is a Red-Black Tree. d. O(n log in) time, if S is in decreasing order and T is a Skew Min-Heap. The maximum number of CUT operations directly or indirectly invoked by a single Delete operation on a Fibonacci Heap of size n is. a. 0(1) b. 001) c. logo where = (1 + 512 d. logni