The solution to the following recurrence T(n)= 27T(n/3) +n^3 using the master theorem is Select one: O a. O(n.log n) O b. Master theorem can't be applied O c. On^3 log n) d. On^3) If an edge is removed from a digraph, then the number of strongly-connected components: of Select one: O a. cannot change b. can only increase c. can only decrease d. may change arbitrarily gestion