Q2: You have an array of n integer numbers, and another number x. You need to find out whether the sum of any two consecutive numbers in the array equals x or not. a. Give an algorithm to solve the problem. (pseudocode). b. Analyze its complexity (Show run-time complexity). c. Implement the algorithm using Java and provide a test class program to test it