Task $-1$:

$[35$ pts$.]$

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 it 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 element