PLEASE HELP. VERY STUCK I need help with the following problems: 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. ****important note: DO NOT use looping as a solution****** 3)Using Java, test the folowing algorithms for a list of integers, and compare the results of your two solutions and assess which one does more or less work Submit your algorithms in a Java text file. Your method should use the signature as follows: public int[] minMax(int[] nums, int begin, int end) { }