Return an integer array containing only the values from the input array that are larger than the threshold value. The relative order of the values should not be changed. threshold([1, 2, 3, 4, 5], 3) → [4, 5] threshold([5, 4, 3, 2], 0) → [5, 4, 3, 2] threshold([20, 1, 19, 3, 22, 4], 15) → [20, 19, 22]     public int[] threshold(int[] nums, int threshold) {            write code in here using this outline }

Given an array, find the next greater element for each element in the array, ifavailable. If not available, print the element itself. The next greater element y for anelement x in the array is the first element that is greater than x and occurs on its rightside. The next greater element of the right most element in an array is the elementitself.Example: Given A = [ 6 8 4 3 9] the next greater element listB = [8 9 9 9 9].

JAVA Programming Write a function that returns true if you can partition an array into one element and the rest, such that this element is equal to the product of all other elements excluding itself. Examples canPartition ([2, 8, 4, 1]) → true // 8 = 2 x 4 x 1 canPartition ([-1, -10, 1, -2, 20]) → false canPartition ([-1, -20, 5, -1, -2, 2]) true