Language is in Java, please explain the answer using comments, Thank you. I always rate!!!

PLEASE DO NOT import any packages to solve the problem. PLEASE use classes and methods from java.lang.*, since they are automatically imported without import statement.

build a method called;

public static int secondFreqInt(int[] a)

This method takes an array of integers and returns the second most frequent value in this array.

You can assume that the array is non-empty and has at least two unique numbers.

In the case of different values are all the second most frequent, you can just return any one of them.

not allowed to use any built-in function to directly find the solution.

Assume there are n elements in the given array, and the difference between max and min values in the array is m. Try to achieve this in O(n) or O(m) (The most efficient solution can be faster than O(n2))

Example:

Input: [3, 4, 4, 4, 5, 3]

Output: 1

Input: [7, 10, 3, 2, 10, 7, 7, 10]

Output: 7 or 10

Input: [5, 44, 44]

Output: 5