I5 6) 13 a0 ) ce c) Consider two binary search trees A and B. (They are NOT AVL trees, just plain BSTs.) BST A has nodes, and BST B has y nodes. Assume there are no duplicates in the entire set of items in A and B. Describe the fastest algorithm to output the combined set of items in A and B in sorted (ascending) order. You can use additional array space if you need to, but no other data structure. Derive the worst case big O running time of your algorithm (If your algorithm is not the fastest, it will get at most 3 points) ecd nade of A equ rett redt or B wtile.tte neden A yheo)