Q1. 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: count0 c=3 for i -0 to C do sumo for j = 0 to n-1 do { sum sumAO] for k1 to j do sum-sum A[k] if B [i] == sum then count-count + 1 return count