Write a function bool equals(int a[], int a_size, int b[], int b_size) that checks whether two arrays have the same elements in the same order.

Rohit is tasked with writing a program to check if two integer arrays are equal. The program should take two arrays as input and determine whether they are equal, i.e., they have the same elements in the same order.Your task is to help Rohit to complete this task.Input format :The first line of input consists of an integer N, representing the size of the first array.The second line consists of N space-separated integers, representing the elements of the first array.The third line consists of an integer M, representing the size of the second array.The fourth line consists of M space-separated integers, representing the elements of the second array.Output format :If the two arrays are equal, the output prints "Equal". Else, print "Not Equal".Refer to the sample output for formatting specifications.Code constraints :1 ≤ N, M ≤ 101 ≤ array elements ≤ 1000Sample test cases :Input 1 :31 2 331 2 3Output 1 :EqualInput 2 :31 2 341 2 3 4Output 2 :Not EqualInput 3 :378 96 54378 54 96Output 3 :Not Equal

You are given two arrays of integers a1,a2,…,an and b1,b2,…,bn. Before applying any operations, you can reorder the elements of each array as you wish. Then, in one operation, you will perform both of the following actions, if the arrays are not empty:1. Choose any element from array a and remove it (all remaining elements are shifted to a new array a)2. Choose any element from array b and remove it (all remaining elements are shifted to a new array b)Let k be the final size of both arrays. You need to find the minimum number of operations required to satisfy aiInput Format2 (size of arrays a & b)1 1 (array a)3 2 (array b)Constraintsall inputs are positive integersOutput Format0 (number of minimum operations)Sample Input 041 5 1 53 8 3 3Sample Output 01

Copy the skeleton of code below into your answer.  Then in the space indicated, add your own code to write a method that takes two arrays  and returns a new array the LENGTH OF THE SHORTER of the two where at each position if the two elements don't match there is a 0 and if the two elements do match there is a copy of that value.  The two original arrays should NOT be changed by this method.For example, if the calling method makes the callint[] array1 = {2, 4, 5, 7, 3, 5, 7, 88};int[] array2 = {8, 4, 3, 0, 3};int[] result = matches(array1,array2);After the call finishes, array and result will have the values:result = {0, 4, 0, 0, 3}array1 = {2, 4, 5, 7, 3, 5, 7, 88}array2 = {8, 4, 3, 0, 3}As another example, if the calling method makes the callint[] array1 = {8, 3, 7};int[] array2 = {8, 9, 7, 9, 4};int[] result = matches(array1,array2);After the call finishes, array and result will have the values:result = {8, 0, 7}array1 = {8, 3, 7}array2 = {8, 9, 7, 9, 4} If the method is called with any 0-length array it should return a new 0-length array:int[] array1 = {2, 4};int[] array2 = {};int[] result = matches(array1, array2);After the above call finishes, array and result will have the values:result = {}array1 = {2, 4}array2 = {}Use the skeleton of the method below to write your code.public static int[] matches(int[] arr1, int[] arr2) {   // TODO: Replace with your code}

Given two arrays of size N and M, insert them into two sets A and B.Implement the following operations in the same sequential order:Union of A and B: Find the union of A and B, print the elements of the resulting set in sorted order.Intersection of A and B: Find the intersection of A and B, print the elements of the resulting set in sorted order.Symmetric Difference of A and B: Find the symmetric difference of A and B, print the elements of the resulting set in sorted order.Check if A and B are disjoint sets: If yes, print true, otherwise, print false.Check if A is a subset of B: If yes, print true, otherwise, print false.Check if A is a superset of B: If yes, print true, otherwise, print false.Input FormatThe first line of input contains N, the size of array1. The second line of input contains N elements of array1.The third line of input contains M, the size of array2. The fourth line of input contains M elements of array2.Output FormatFor subset, superset, and disjoint operations print True or False. And for remaining all operations, if resulting set is not empty, print the sorted set separated by spaces, otherwise skip printing the set.Constraints1 <= N, M <= 501 <= array1[i], array2[i] <= 100ExampleInput49 6 8 739 9 6Output6 7 8 96 97 8falsefalsetrue

You are given an array 𝐴A of size 𝑁N.You can rearrange the elements of 𝐴A as you want. After that, construct an array 𝐵B of size 𝑁N as:𝐵1=𝐴1B 1​ =A 1​ ;𝐵𝑖=𝐵𝑖−1B i​ =B i−1​ && 𝐴𝑖A i​ for all 2≤𝑖≤𝑁2≤i≤N, where && denotes the bitwise AND operator.Find the lexicographically largest possible array 𝐵B.For two arrays 𝑋X and 𝑌Y, both of size 𝑁N, the array 𝑋X is said to be lexicographically larger than array 𝑌Y, if, in the first position where 𝑋X and 𝑌Y differ, 𝑋𝑖>𝑌𝑖X i​ >Y i​ .Input FormatThe first line of input will contain a single integer 𝑇T, denoting the number of test cases.Each test case consists of multiple lines of input.The first line of each test case contains 𝑁N, the size of the array 𝐴A.The second line of each test case contains 𝑁N space-separated integers 𝐴1,𝐴2,…,𝐴𝑁A 1​ ,A 2​ ,…,A N​ .Output FormatFor each test case, output on a new line, 𝑁N space separated integers denoting the lexicographically largest array 𝐵B that can be formed by any rearrangement of 𝐴A.Constraints1≤𝑇≤2⋅1041≤T≤2⋅10 4 1≤𝑁≤2⋅1051≤N≤2⋅10 5 1≤𝐴𝑖≤1091≤A i​ ≤10 9 The sum of 𝑁N over all test cases does not exceed 2⋅1052⋅10 5 .