Which best describes the time complexity of the recursive decrease-and-conquer (DEC) and divide-and-conquer (DIV) approaches to finding the minimum of an array of n unsorted elements? Multiple...

No plagarism please!

Correct and detailed answer will be Upvoted else downvoted. Thank you!

Extracted text: Which best describes the time complexity of the recursive decrease-and-conquer (DEC) and divide-and-conquer (DIV) approaches to finding the minimum of an array of n unsorted elements? Multiple answers: Multiple answers are accepted for this question Select one or more answers and submit. For keyboard navigation. SHOW MORE V a DEC: T(n) = T(n/2) + 1 b DEC: T(n) = T(n/2) + n DEC: T(n) = 2T(n/2) + 1 d DEC: T(n) = 2T(n/2) +n DEC: T(n) = T(n-1) + 1 f DIV: T(n) = T(n/2) + 1 DIV: T(n) = T(n/2) + n h DIV: T(n) = 2T(n/2) + 1 i DIV: T(n) = 2T(n/2) + n j DIV: T(n) = T(n-1) +1