The recurrence relation for the Merge Sort algorithm is defined by:

I. T$($n$)=$T$($n$-1)+1$

II$.$ T$($n$)=2$T$($n$/2)+1$

III. T$($n$)=$T$($n$-1)+$Theta$($n$)$

IV$.$ T$($n$)=2$T$($n$/2)+$Theta$($n$)$

V$.$ None of the above

Group of answer choices

II

IV

III

I

V