Please help me to solve this code check

/** * Processing Arrays with Loops * * @author * @version */ public class PS15B { /** * Write the method catch22(). * * Given an array of ints, return * true if the array contains a 2 * next to a 2, anywhere in the array. * * Examples: * catch22({1, 2, 2}) returns true * catch22({1, 2, 1, 2}) returns false * catch22({2, 1, 2}) returns false * * @param nums the array to search. * @return true if two adjacent 2s are in the array. */ // TODO - Write the catch22 method here. /** * Write the method bigDiff(). * * Given an array length 1 or more of ints, * return the difference between the largest * and smallest values in the array. * * Examples: * bigDiff({10, 3, 5, 6}) returns 7 * bigDiff({7, 2, 10, 9}) returns 8 * bigDiff({2, 10, 7, 2}) returns 8 * * @param nums the array to search. * @return the difference between the largest and * smallest numbers in the array. */ // TODO - Write the bigDiff method here. /** * Write the method matchUp(). * * Given arrays nums1 and nums2, of the same length, * for every element in nums1, consider the corresponding * element in nums2 (at the same index). Return the * count of the number of times that the two elements * differ by 2 or less, but are not equal. * * Examples: * matchUp({1, 2, 3}, {2, 3, 10}) returns 2 * matchUp({1, 2, 3}, {2, 3, 5}) returns 3 * matchUp({1, 2, 3}, {2, 3, 3}) returns 2 * * @param nums1 the first array of int. * @param nums2 the second array of int. * @return the number times the elements, while not equal, are within 2. */ // TODO - Write the matchUp method here. }