Let A and B be two arrays, each consisting of n numbers sorted in increasing order. We are also given a number & and would like to find and return i and j such that A[i] + B[j] = x. If no such pair exists, we would like to return FALSE. We would like to develop an algorithm to solve this problem in linear time. (a) Using pseudo-code, describe an algorithm that correctly solves this problem in linear time. (b) Explain graphically how your algorithm works. (c) Using loop invariants, prove that your algorithm is correct. (d) Show that the worst-case runtime of your algorithm is e(n)