For the following algorithms, write down the recurrence relation associated with the runtime of the algorithm. You do not have to solve the recurrence relation. (a) Algorithm A solves problems by dividing them into five sub-problems of half the size, recursively solving each sub-problem, and then combining the solutions in linear time. For a problem of size 1, the algorithm takes constant time. (b) Algorithm B solves problems of size n by recursively solving two sub-problems of size n-1 and then combining the solutions in constant time. For a problem of size 1, the algorithm takes constant time. (c) def hello(n) { if (n > 1) { print( 'hello''hello''hello' ) hello(n/7) hello(n/7) hello(n/7) hello(n/7) }}