4. For a set S consisting of (distinct) integers and an element x E S, rank(x) is the number of n a Binary Search Tree T,g algorithm, that outputs all leaf nodes along with their ranks. Analyze the worst-case run time of your algorithm and prove its correctness. Your algorithm must be recursive, otherwise you will not receive any credit