Write a Java method that counts increasing sets in an integer array. The sets do not overlap. Example: 10,9,9,4,5 Output would be 3 (10) (9,9) (4,5)

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?

Please help with this java problem

Check if Array Elements are Consecutive in Java. Given an array, we need to check if array contains consecutive elements. For example: Input: array[] = {5, 3, 4, 1, 2} Output: true As array contains consecutive elements from 1 to 5 Input: array[] = {47, 43, 45, 44, 46} Output: true As array contains consecutive elements from 43 to 47 Input: array[] = {6, 7, 5, 6} Output: false As array does not contain consecutive elements.

THIS IS DONE IN JAVA

Create a JAVA program to print every even numbers in the set stored with an array of 20 for the size.  Array then gets initialized with random numbers-use SecureRandom class of Java API

Java