2. Suppose that you are given Binary Search Tree T and and integer k. Assume that nodes of T hold distinct integers. Give two integers a and b (ab) in T let stan cea ,b = |a Give an algorithm that gets T and k as inputs and finds a pair a,b T such that Distancea,b-min( Distance,,u I u E T, u E T, u U}. Analyze the worst-case time complexity of your algorithm and justify the correctness