You are given an array A of size n. Suppose the following algorithm is used to print out the elements of A in sorted order. Give an upper bound on its time complexity. Do not assume that any height balancing happens after insertions. Initialize B Empty Binary Search Tree. for i 1 to n Insert Ali] into B Print out the elements in an in-order traversal of B