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. Ap+1....q) and A[q+1...n). The A array looks like this: Pp+1 - 99+1 You are to put the final sorted array in B. How much work is done by your algorithm? 4. Chapter 3. Prove that if fen(g)and gew(h) then fen(h).Is it true that few(h)? Explain your