Problem 3 Find the tight-bound complexity of this program. Here, the input size, , is the total number of items in both input lists, A and B. [2]: Problem 4 Use substitution to find the tight-bound complexity of this function: T(n) = 13 + T(n-1), and T(0) = 13. Show all the steps of your work..