Write a program that takes an array of integers as input and prints all its subarrays, ensuring that they are sorted based on the forward direction and the count of elements.Constraints:The length of the array is at least 1 and at most 100.Each element of the array is an integer between -1000 and 1000.Input:The input consists of two lines. The first line contains an integer, n, which is the length of the array. The second line contains n space-separated integers, representing the elements of the array.Output:The program should print all the subarrays of the given array in increasing order, one subarray per line.

The program should print all the subarrays of the given array in increasing order, one subarray per line.Sample Input:4 //size of array1 2 3 4Sample Output:11 21 2 31 2 3 422 32 3 433 44

Read Array Size and ElementsWrite a Program to read the Array Size and Array Values from the User and Print Array Values?Constraints:Input          :- First Line of Input Consists of One Integer Value (Array Size).                     Second Line of Input Consists of few Integer Values Separated by Spaces (Array Elements).Output        :- Print the All Array Elements.Constraints  :- NoExample:Input 1  :    8                  86 210 33 73 53 93 848 48Output 1:    86 210 33 73 53 93 848 48 Input 2  :    6                  1 2 3 4 5 6Output 2:    1 2 3 4 5 6 Input 3  :    5                  5 10 88 2 5Output 3:    5 10 88 2 5

You are given an array of size N containing unique integers. Find the size of the largest subarray that can be rearranged to form a contiguous sequence.A contiguous sequence means that the difference of adjacent elements should be 1.Input FormatThe first line of input contains T - the number of test cases. It's followed by 2T lines, the first line contains N - the size of the array. The second line contains the elements of the array.Output FormatFor each test case, print the size of the largest subarray that can be rearranged to form a contiguous sequence, on a new line.Constraints30 points1 <= T <= 1004 <= N <= 10070 points1 <= T <= 1004 <= N <= 1000General Constraints0 <= A[i] <= 105ExampleInput251 3 2 6 590 8 6 5 7 10 3 2 1Output34ExplanationTest-Case 1The largest subarray that can be rearranged to form a contiguous sequence is [1, 3, 2] which can be rearranged to form [1, 2, 3].Test-Case 2The largest subarray that can be rearranged to form a contiguous sequence is [8, 6, 5, 7] which can be rearranged to form [5, 6, 7, 8].

Given an array of unique integer elements, print all the subsets of the given array in lexicographical order.Input FormatThe first line of input contains T - the number of test cases. It's followed by 2T lines, the first line contains N - the size of the array and the second line contains the elements of the array.Output FormatFor each test case, print the subsets of the given array in lexicographical order, separated by new line. Print an extra newline between output of different test cases.Constraints1 <= T <= 1001 <= N <= 100 <= A[i] <= 100ExampleInput335 15 3 257 96 43 15 8 23 Output3 3 5 3 5 15 3 15 5 5 15 15 57 57 96 96 3 3 8 3 8 15 3 8 15 23 3 8 23 3 15 3 15 23 3 23 8 8 15 8 15 23 8 23 15 15 23 23

Given an array A of N integers and an integer K, write a program to print the number of subarrays in A whose sum is divisible by K.