COMP359 - Assignment 1 Please type your solutions and submit one pdf file on Blackboard. = 1. Use the master theorem to find the tight asymptotic bound (O) for the following recurrences: a. T(n) = 27(n/4) + 1 b. T(n) = T(2n/3) + n 2. Solve the following recurrences (in terms of O): a. T(n) = T(n/2)+27(n/4) +n T(n) = (n-2) + n 3. Suppose you are given the following three algorithms: a. Algorithm A solves problems of size n by dividing them into five subproblems of half the size, recursively solving each subproblem, and then combining the solutions in linear time. b. Algorithm B solves problems of size n by recursively solving two subproblems of size n-1, and then combining the solutions in constant time. C. Algorithm C solves problems of size n by dividing them into nine subproblems of size n/3, recursively solving each subproblem, and then combining the solutions in O(n) time. What is the running time of each algorithm (in big-O notation) and which one you would choose