Solve in the java programming true if all element combinations add up to the same number. Otherwise, return false. Examples puzzlePieces([1, 2, 3, 4], [4, 3, 2, 1]) → true // 1 + 4 = 5; 2 + 3 = 5; 3 + 2 = 5; 4 + 1 = 5 // Both arrays sum to [5, 5, 5, 5] puzzlePieces([1, 8, 5, 0, -1, 7], [0, -7, -4, 1, 2, -6]) → true

Given the below 2 arrays: int​ arr1​[]​ ​=​ ​{​ 9,8,7,6,5,4,3,2,1,0 ​}; int​ arr2​[]​ ​=​ ​{​ ​99, 89, 79, 69, 59​ ​}; Write a program to replace 79 in arr2 with 4 from arr1. Print the final arr2 using Arrays.toString() method. Hint​: Use ​System​.​arraycopy() methodNote​: For all these programs, please submit the program’s .java file and screenshot of output.

Complete the combinations function to generate all combinations of the characters in the string s with length k recursively

public class ArraySection {     static void arraySection(int a[], int b[]) {        int k =  0;        int [] c = new int[a.length];        for(int i = 0; i < a.length; i++) {            for(int j = 0; j < b.length; j++)                if(a[i] == b[j])                    c[k++] = a[i];                                        }        for(int i = 0; i < k; i++)            System.out.println(c[i]);            System.out.println();    }    public static void main(String[] args) {         int a[] = { 1, 2, 3, 4, 5 };        int b[] = { 0, 2, 4,5 };                        arraySection(a,b);        }}   Calculate the algorithm step number and algorithm time complexity of the above program?