What is the big-Oh (O) time complexity for the following algorithm (shown in pseudocode) in terms of input size n? Show all necessary steps: (a) Algorithm MyAlgorithm (A,B) Input: Arrays A and B each storing n >= 1 integers. Output: What is the output? (Refer to part b below) Start: count = 0 C = 3 for i 0 to C do { sum = 0 for j = 0 to n-1 do { sum = sum + A[0] for k=1 to j do sum = sum + A[k] = } if B[i] == sum then count = count + 1 } return count (b) Document a hand-run on MyAlgorithm for input arrays A = [9 2 5 1] and B = [40 29 2 57] and show the final output.