3. Chapter 2. Write your own algorithm in pseudo-code that merges three sorted arrays. The function is MERGE3(A, p, q, n, B). The three sorted arrays are in A as A[1,...pl, A[p+1....2) and A[q+1...n). The A array looks like this: pp+1 q9+1 You are to put the final sorted array in B. How much work is done by your algorithm