Find the tight-bound complexity of this program. Here, the input size, n, is the total number of items in both input lists, A and B. \# \# Input : two lists of numbers A and B \# Output : another list of numbers \# def prob3 (A,B) : output =[] for x in A : output +=xx for y in B : output +=yyy return output