3. Suppose you are given an array of n integers. Assume that n 2 2. Your goal is to find largest and second largest elements of the array. Consider the following algorithm: If A[1]A[2], largestA[2], SecondA[1] else largestA[1], SecondA[2]; For i in range 3 to n t If A[i] > largest [ second largest; largest A[i]; else if A[i] > second second =A[i] . In worst-case, how many comparisons are made among the elements of A? Give the exact number of comparisons in worst-case, not asymptotic bound. Le, Your answer must be an expression such as 2n or 3n - 4 instead of O(n) . Design an algorithm that reduces the number of comparisons made among the elements of A. Derive the number of comparisons. Your grade depends on the number of com- parisons