Question3 13 pts tee Consider a B-tree T which has the minimum degree t. Assume that all the keys in the tree are distinct. Write the pseudocode for an algorithm which computes the predecessor of a key x. keyi, called B-Tree-Predecessor(T,x.i). What is the RT of your algorithm? (10 pts) Write the pseudo-code 3 pts) Analyze its worst-case running time. coled B Tree Predecesshe predecesson Upload Choose a File