Stefan is working on a coding project that involves finding all pairs in an integer array that sum up to a specific target value.He needs to create a program to automate this task. The program should take an array of integers and a target value as input and then find and display all pairs of integers in the array that add up to the given target.Help Stefan to complete the project.Input format :The first line of input consists of an integer N, representing the number of elements in the array.The second line consists of N space-separated integers, representing the elements of the array.The third line consists of an integer T, which is the sum Stefan wants to find pairs for.Output format :The first line of output prints "Pairs that sum up to [T]:".The following lines print all pairs of integers that sum up to the given target in the format: "X + Y", where X and Y are the integers that sum up to T.Refer to the sample output for formatting specifications.Code constraints :1 ≤ N ≤ 201 ≤ array elements, T ≤ 100Sample test cases :Input 1 :52 3 5 7 810Output 1 :Pairs that sum up to 10:2 + 83 + 7Input 2 :83 8 15 6 12 7 9 217Output 2 :Pairs that sum up to 17:8 + 915 + 2Input 3 :126 10 14 25 3 11 18 1 7 40 15 934Output 3 :Pairs that sum up to 34:25 + 9

Single File Programming QuestionProblem StatementKrish is a computer science student who loves solving challenging problems. Recently, he came across an interesting problem related to arrays. The problem requires Krish to find all pairs of elements in a given array whose sum equals a specific target value. Write a program for Krish that takes an array of integers and a target sum as input. The program should print all pairs of elements from the array whose sum equals the target sum. If no such pairs are found, it should print "Not found".ExampleInput:5 // number of elements10 20 30 40 50 // elements60 // target sumOutput:10 5020 40Explanation: The pair with 60 as sum are 20 + 40 = 60 and 10 + 50 = 60.Input format :The first line consists of an integer N, representing the number of elements in the array.The second line consists of N space-separated integers, representing the elements of the array.The third line consists of an integer M, representing the target sum.Output format :For each pairs found, print two integers separated by a space, whose sum equals the target sum.If no such pairs are found, print "Not found".Refer to the sample output for the formatting specifications.Code constraints :In this scenario, the test cases will fall under the following constraints:2 ≤ N ≤ 251 ≤ Each element ≤ 1003 ≤ M ≤ 200Sample test cases :Input 1 :32 3 65Output 1 :2 3Input 2 :510 20 30 40 5060Output 2 :10 5020 40Input 3 :42 3 4 78Output 3 :Not foundInput 4 :310 6 410Output 4 :6 4

Given an array of elements. Find two elements in the array such that their sum is equal to the given element K.Input format :The first line of the input consists of the value of n.The second line of the input consists of the array of elements separated by space.The third line of the input consists of the sum.Output format :The output prints whether the array has a pair of elements with the given sum.Sample test cases :Input 1 :61 4 45 6 10 -816Output 1 :Array has two elements with given sum 16Input 2 :61 4 45 6 10 -860Output 2 :Array doesn't have two element

Java program to sum values of an array.Write a Java program to sum values of an array. Constraints:N/AExample:Input:1, 2, 3, 4, 5, 6, 7, 8, 9, 10Output:55Explanation:-Public Test Cases:# INPUT EXPECTED OUTPUT1 1, 2, 3, 4, 5, 6, 7, 8, 9, 1055

1. Two SumEasy53.1K1.8KCompaniesGiven an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.You may assume that each input would have exactly one solution, and you may not use the same element twice.You can return the answer in any order. Example 1:Input: nums = [2,7,11,15], target = 9Output: [0,1]Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].Example 2:Input: nums = [3,2,4], target = 6Output: [1,2]Example 3:Input: nums = [3,3], target = 6Output: [0,1] Constraints:2 <= nums.length <= 104

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.You may assume that each input would have exactly one solution, and you may not use the same element twice.