Consider a B-tree T which has the minimum degree t. Assume that all the keys in the tree are distinct. In addition to the attributes defined in class, we define x.p as being a pointer to the parent node of the node x. Write the pseudocode for an algorithm which computes the successor of a key , called B-Tree-Successor(T,x,i). What is the RT of your algorithm? (8 pts) Write the pseudo-code (2 pts) Analyze its worst-case running time.

Note the following:

1. Show the pseudocode for all functions and procedures used.
2. The successor of a keykis the smallest key greater thank.