The Master Theorem provides a method for determining the time complexity of algorithms that follow which general recurrence relation?

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

T$($n$)=2$T$($n$/2)+$ n

T$($n$)=$ n$^2+$ n

T$($n$)=$ log$($n$)$