6. Design an algorithm for a function that given two binary search trees Compare (BST T1, BST T2) will determine whether those two binary search trees are the same, that is, the same size (number of elements) and have the same elements. Estimate, using the big O notation the running time of your algorithm.+ Note While T1 and T2 might be the same (as defined above) they do not need to have the same structure (shape)