*only 5.Lower Bound part need help.

Exercises Ex 6.1. Prove a worst case lower bound of 2 comparisons for any algo rithm which finds the largest and smallest elements in an array by using only comparisons. Devise a divide-and-conquer algorithm for this problem. Show that your algorithm us es n-2 comparisons