Give asymptotic upper and lower bounds for T(n) in each of the following recurrences. Assume that () is constant for 1. Make your bounds as tight as possible. (1) () = 5(/2) + 2, (2) () = (1) +

Note: - You first need to briefly explain your ideas to solve the problem, e.g. what data structures are used, how the intermediate results are saved, which sorting strategy is used, and why the final results are correct; - Your pseudo code needs to follow the format given in the textbook (e.g. Partition procedure ): PARTITION (A,p,r) You can also use any procedures/functions defined in the textbook in your pseudo code. Concrete code from a specific programming language such as Python or Java copied from elsewhere is NOT acceptable. - You always need to provide a complexity analysis for your algorithmic design or description