Question 1. [10 points] We'll say that a value is "consistently present" in an array if for every pair of adjacent elements in the array, at least one of the pair is that value. Return true if the given value is consistently present in the array. consistent([1, 2, 1, 3], 1) true consistent([1, 2, 1, 3], 2) + false consistent([1, 2, 1, 3, 4], 1) false Write the body of the method signs whose signature is given to you below: (you cannot modify the signature) public static boolean consistent(int[] A, int val) Question 2. [10 points] Given a string str and an int num, return a string made of the last n characters of the string, followed by the last n-1 characters of the string, and so on. You may assume that n is between 0 and the length of the string, inclusive (i.e. n >= 0 and n