Design a program that takes an integer array as input and swaps the values of elements whose digit sums are equal. Use pointers to solve the problem.ExampleInput:6 12 56 23 33 30 32Output:30 56 32 33 12 23 Explanation:The values 12 and 30 are swapped because their digit sums (3) are equal, and similarly, the values 23 and 32 are swapped due to their equal digit sums (5).Note: This question helps in clearing technical coding tests of service-based companies.Input format :The first line of input consists of an integer N, representing the number of array elements.The second line consists of N space-separated integers, representing the array elements.

Write a C++ program that takes two integers as input and swaps their values without using a temporary variable. sample input and output Enter two integers: 10 20 Before swapping: num1 = 10, num2 = 20After swapping: num1 = 20, num2 = 10

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

Single File Programming QuestionProblem StatementYou are given an integer array of N elements. Find out the sum of the first N/2 elements and the sum of the last N/2 elements using pointers.ExampleInput: 102 2 2 2 2 3 3 3 3 3Output: 1015Explanation:N = 10 -> N/2 = 5sum of the first 5 elements = 2+2+2+2+2 = 10sum of the last 5 elements = 3+3+3+3+3 = 15Note: This question helps in clearing conceptual interviews of service-based companies.Input format :The first line of input consists of an integer N, representing the number of array elements.The second line consists of N space-separated integers, representing the array of elements.Output format :The first line of output prints the sum of the first N/2 elements of the given array.The second line prints the sum of the last N/2 elements of the given array.Refer to the sample output for formatting specifications.Code constraints :N is an even number.10 ≤ N ≤ 50-50 ≤ array elements ≤ 50Sample test cases :Input 1 :102 2 2 2 2 3 3 3 3 3Output 1 :1015Input 2 :207 26 17 23 -6 -23 26 -23 -25 -18 -18 -5 3 22 -9 -22 -28 18 -16 21Output 2 :4-34

12345678910111213141516#include <stdio.h>void swap(int *x, int *y) { int temp = *x; *x = *y; *y = temp; printf("%d %d", *x, *y);}int main() { int a = 120; int b = 121; printf("%d %d\n", a, b); swap(&a, &b); return 0;}

Given an array arr of n positive integers. The task is to swap every ith element of the array with (i+2)th element.