Need help of the 7question,better with some explains,thx.

100) what is the lower bound of all comparison-based sorting algorithms? Justify your answer (10%) Construct a max heap using a bottom-up strategy. Illustrate the algorithm with the following input sequence: 3, 2, 7, 4, 8, 5, 6, 9, 1. You should draw the heap for each step. (15%) Consider a stick of length m meters that has t 7 8, o ha