Consider the following sequence of dictionary operations on any size n dictionary T: X Minimum(T) while xu nil do print Search(key[x], T) Xe Successor(x,T) end Time complexity of this sequence is // dictionary search starts from the root a Oorlog m) if I is a Red-Black tree, and is on log n) if T is a Splay tree, b. 00n) if T is a Red-Black tree, and is on) if T is a Splay tree. c. 001) if T is a Red-Black tree, and is oorlog n) if Tis a Splay tree. d. On log) if T is a Red-Black tree, and is 06n) if T is a Splay tree