To sort 6 elements requires a minimum of 5 comparisons. No algorithm can sort 6 elements with fewer than 5 comparisons. To sort 7 elements requires a minimum of 6 comparisons as no algorithm exists that can sort 7 elements with less than 6 comparisons.

1. Find the smallest number of comparisons that can sort an array of 6 elements. (Note: this
requires two things: (i) finding an algorithm that sorts 6 elements with X comparisons (ii)
proving that no algorithm that uses comparisons will sort an array of 6 elements with less than X
comparisons) Do the same for 7 elements. Please, use a few sentences in plain English. No
pseudocode.