What is the time complexity of a decrease and conquer algorithm that solves the

problem of size $n$ by recursively solving a problem of size $n-1?$ Assume every other

task is trivial.

$O(n)$

$O(n^2)$

O$(logn$

$O(nlogn)$