(10 points) Consider the below implementation of the hasDuplicates () function from Problem Set 3 #7. (a) (5 points) Using big-O notation, what is the worst-case running time of the below method? Justify your answer. (b) (5 points) Using big-S2 notation, what is the best-case running time of the below method? Justify your answer. public static boolean hasDuplicates (int [] list) 1 for (int i -0; i