Problem #1: (15 points) Write a linear (O(N)) running time complexity program in Java to find all the dominant elements in the given array of N distinct integer elements. An element is a dominant element if is greater than all the elements to its right side. The rightmost element in the array is always a dominant element. For example, in the array {16, 17, 4, 3, 5, 2}, dominant elements are 17, 5 and 2. Important Notes: You must add the main method in your program in order to test your implementation. There are no data errors that need to be checked as all the data will be assumed correct. You can use the array of the previous example to test your program, however, I suggest that you also use other input arrays to validate the correctness and efficiency of your solution. Your program MUST be submitted only in source code form (java file). A program that does not compile or does not run loses all correctness points. Problem #2: (20 points) Write a program in Java to implement a recursive boolean function verify that returns True if the given array contents remain the same when array is reversed, i.e., when last element is equal to the first element, second last element is equal to the second element and so on. Otherwise function verify must returns False. Examples: Input: arr[] = {12, 32, 67, 32, 12} Output: True Input: arr[] = {1, 2, 3, 4, 5} Output: False Important Notes: You must add the main method in your program in order to test your implementation. There are no data errors that need to be checked as all the data will be assumed correct. You can use the array of the previous example to test your program, however, I suggest that you also use other input arrays to validate the correctness and efficiency of your solution. Your program MUST be submitted only in source code form (java file). A program that does not compile or does not run loses all correctness points