Q4 : The solution to the following recurrence relation T(n)=6n + T(n-1) is Select one:

a. (log n)

b. (n^2)

c. (n.log n)

d. (n^3)

Q5: Running HeapSort on the following array [Q, H, T, A, K, X, E, I, M, U, L] would generate Select one:

a. [A, E, H, I, K, L, M, Q, T, U, X]

b. [X, U, T, M, K, Q, E, I, A, H, L]

c. [X, U, T, M, L, Q, E, I, A, K, H]

d. [U, T, X, M, L, Q, E, I, K, A, H]