For each of the following problems, design an O(n log n)-time divide-and-conquer algorithm. Your answer for each of the problems must have the following three parts. First, (a) write your divide- and-conquer algorithm in pseudocode, then (b) analyze the running time of the algorithm by writing a recurrence relation, and finally (c) use any of the methods that we learned in class to solve the recurrence relation. Problem 1. Given an input array A of n real values and a value v (where A is not necessarily sorted), your algorithm must return true if there are two distinct indices i and j such that A[i] + A[j] = x; it must return false otherwise. Problem 2. Given two n-element arrays A and B of real numbers and a value v (where none of the arrays is necessarily sorted), your algorithm must return true if there are indices i and such that A[i] + B[j] = v; it must return false otherwise