I need help with the following assignment: Another problem of element selection is to find both the largest and the smallest elements in a list of n elements at the same time. 1)Present a single brute-force algorithm for the problem and describe the key idea behind your solution. Determine and show the range for the number of element comparisons performed. 2)Develop a single recursive divide-and-conquer algorithm for the problem and describe the key idea behind your solution. Establish and solve the recurrence relation for the number of element comparisons performed. 3)Additionally, test the both of the following algorithms in Java These algorithms have to be done WITHOUT the use of sorting ***please help. I really can't think of an algorithm that doesn't use sorting and I also have a very shaky understanding of determining the range of the number of comparisons, as well as establishing and solving the reccurrence relationship***