The recurrence T$($n$)=2$T $($n $-2)+$ n describes the time of an Algorithm A$.$ A competingalgorithm A$\text{'}$ has a running time of T$($n$)=4$T $($n $-$ b$)+$ n$.$ What is the smallest integer valuepossible for b such that A$\text{'}$ is asymptotically faster than A$?*$Assume both algorithms share the same case.