Determine the growth function and time complexity (in Big-Oh notation) of the findMin method. Please annotate the code showing how you got that. //Test.java public class Test { @SuppressWarnings("unchecked") public static T findMin(Comparable array[]) { T min = null; for (int i = 0; i < array.length; i++) { if (min == null || array[i].compareTo(min) < 0) { min = (T) array[i]; } } return min; } }