You are given two strings pattern and s. The first string pattern contains only the symbols 0 and 1, and the second string s contains only lowercase English letters. Let's say that pattern matches a substring s[l..r] of s if the following 3 conditions are met: they have equal length; for each 0 in pattern the corresponding letter in the substring is a vowel; for each 1 in pattern the corresponding letter is a consonant. Your task is to calculate the number of substrings of s that match pattern. Note: In this task we define the vowels as 'a' 'e', 'i', 'o', 'u', and 'y'. All other letters are consonants.

Answertrue

Public static int mystery(int a[], int x) {     int c = 0;     for(int i = 0; i < a.length; i++) {        if (a[i] == x) c++;     } return c; }the method counts how many times an integer shows up in an integer array.the c variable is declared in the method to keep track of how many times the certain value has shown up.the for-loop loops through the entire array.the line    if (a[i] == x) c++;   checks if each element of the array is equal to the inputted integer to check. for each number in the array that is equal to the inputted integer x, the c variable will be incremented by 1. otherwise it will do nothing.then c is returned at the end of the loop.for example, if we have, in the main method with the mystery method coded in the class:     int arraytest[] = {2, 23, 23, 23, 3};     int testme = 23;     int count = mystery(arraytest, testme);     system.out.println(count); then the print out will be    3 because there are three 23s in that array.

Graphical command because it is the one with least permissions