Prove that the following two problems have the same complexity by giving a linear-time reductions between the two. 1. 3-SUM: given n integers x1, ..., x, are there three distinct integers i, j, and k such thatx++3-0 3-SUM-PLUS: given n integers x1, ...,.3, and an integer b are there three distinct integers 1,j, and k such that x-+& +dk= b. Give a linear-time reduction from 3-SUM to 3-SUM-PLUS. To demonstrate your reduction, give the 3-SUM-PLUS instance that you would construct to solve the following 3-SUM instance: x, , dio a. Prove that the following two problems have the same complexity by giving a linear-time reductions between the two. 1. 3-SUM: given n integers x1, ..., x, are there three distinct integers i, j, and k such thatx++3-0 3-SUM-PLUS: given n integers x1, ...,.3, and an integer b are there three distinct integers 1,j, and k such that x-+& +dk= b. Give a linear-time reduction from 3-SUM to 3-SUM-PLUS. To demonstrate your reduction, give the 3-SUM-PLUS instance that you would construct to solve the following 3-SUM instance: x, , dio a