Ononot — A divide-and-conquer algorithm splits a problem of size n in

Guest Session: 1 Question Remaining. Create Account to save progress.

Recursionmedium

0:00.0

A divide-and-conquer algorithm splits a problem of size $n$ into three subproblems of sizes $n/2$ , $n/3$ , and $n/6$ . The cost to split and merge is $O(n)$ . Which statement about the time complexity $T(n) = T(n/2) + T(n/3) + T(n/6) + cn$ is correct?