For a set S consisting of distinct integers and an element E S,rank(x) is the number of elements inS that are less than or equal to r. Given a Binary Search Tree T, create a recursive algorithm using peo cod that ouspa gith their maks Analyze the worst-case run time of your algorithm and prove its correctness. Your algorithm MUST be recursive