Given an array of integer numbers with no duplicates. Write a linear running time complexity program in Java to find and print all the dominator elements in the given input array. An element is a dominator element in the array A, if it is greater than all the elements to its right side. The rightmost element in A is always a dominator element. Example: Consider the array A = {16, 17, 4, 3, 5, 2}. The dominator elements are 17, 5, and 2.

Important Notes:

You must add the main method in your program 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.