Consider a B-tree T which has the minimum degree t. Assume that all the keys in the tree are distinct. Also assume that x is not a leaf node. 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?

Write the pseudo-code and Analyze its worst-case running time.

please do not copy the solution already on Chegg as I will rate it a thumbs down. thanks