5. Suppose you are given two Binary Search Trees T1 and T2. Present the pseudo code for an efficient algorithm to determine if they are identical trees. [Hint: Identical trees mean that they contain the same elements and have the same tree structure, e.g. Fig. (A) and Fig. (B) are identical trees). 14 11 2 / 1 1 3 (A) 14 / 2 11 1 3 (B)