Suppose we want to find the 2nd largest and 2nd smallest elements simultaneously for an input of n numbers stored in an array a[1: n]. compare the following strategies in terms of their exact number of comparisons. strategy 1: adapt the two separate for loops idea for minimum and maximum. strategy 2: run mergesort to sort the numbers in ascending or descending order, then output the 2nd ranked and (n-1)th ranked elements. first write each algorithm in pseudocde, then analyze the exact number of comparisons required by the algorithm. note, asymptotic calculations will only get you partial credit for this problem. can you find a better strategy for this problem than the two given? if yes, write the algorithm and analyze the exact number of comparisons required by the algorithm. if not, prove that one of the given strategies is optimal.

you're giving away points because you can't type stuff out.

explanation:

we can all learn from our past mistakes because we all have different ways of learning different types of techniques. my way may or may not another classmate remember and have the repetition to acknowledge such standard. such as remembering acronyms. using abbreviations to us remember keep things in order in our memory. this us figure out what comes next in the sequence. if so, what we have is a sentence of just letters all in caps. we either know the meaning or have no idea what it stands for. most of the time we know the meaning and context. but most of us who don't know, should learn by having a quick glance at what needs to be remembered. such as repetition in the memory for acronyms. one way that me, is the fact that i'm always doing math and english assignments. so we have to remember specific meanings such as soapstone for documents, such as citing correctly. or pemdas for doing the equations correctly, even if it's the super long way. this works for everyone. you just have to find what works for you by practicing and repetition daily.